Stefan M. Stefanov
Separable Programming - Applied Optimization Stefan M. Stefanov 1st Ed. Softcover of Orig. Ed. 2001 edition

Do you have a profile? 登录

顾客评价：

Top-vurdering på Google Reviews, baseret på tusinder af anmeldelser.

根据欧洲消费者保护法享受14天退换货政策

Trustpilot平台高分认证

添加至iMusic心愿单

Separable Programming - Applied Optimization

Stefan M. Stefanov

1st Ed. Softcover of Orig. Ed. 2001 edition

In this book, the author considers separable programming and, in particular, one of its important cases - convex separable programming. Some general results are presented, techniques of approximating the separable problem by linear programming and dynamic programming are considered.
Convex separable programs subject to inequality/ equality constraint(s) and bounds on variables are also studied and iterative algorithms of polynomial complexity are proposed.
As an application, these algorithms are used in the implementation of stochastic quasigradient methods to some separable stochastic programs. Numerical approximation with respect to I1 and I4 norms, as a convex separable nonsmooth unconstrained minimization problem, is considered as well.
Audience: Advanced undergraduate and graduate students, mathematical programming/ operations research specialists.

314 pages, biography

介质类型	图书 Paperback Book (平装胶订图书)
已发行	2010年12月6日
ISBN13	9781441948519
出版商	Springer-Verlag New York Inc.
页数	314
商品尺寸	156 × 234 × 18 mm · 476 g
语言	英语