|
|
Undergraduate Convexity: From Fourier and Motzkin to Kuhn and Tucker
Starting from linear inequalities and Fourier-Motzkin elimination, the theory is developed by introducing polyhedra, the double description method and the simplex algorithm, closed convex subsets, convex functions of one and several variables ending with a chapter on convex optimization with the Karush-Kuhn-Tucker conditions, duality and an interior point algorithm.
Undergraduate Convexity From Fourier and Motzkin to Kuhn and .pdf
(2.51 MB, 下载次数: 0, 售价: 3 金钱)
|
|
/1 
发表于 2017-2-22 15:50:42
提升卡
置顶卡
沉默卡
变色卡