Separable Programming: Theory and Methods: 53 (Applied Optimization, 53) - Hardcover

Stefanov, S.M.

 
9780792368823: Separable Programming: Theory and Methods: 53 (Applied Optimization, 53)

Synopsis

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.

"synopsis" may belong to another edition of this title.

Other Popular Editions of the Same Title

9781441948519: Separable Programming: Theory and Methods: 53 (Applied Optimization, 53)

Featured Edition

ISBN 10:  1441948511 ISBN 13:  9781441948519
Publisher: Springer, 2010
Softcover