Separable Programming: Theory and Methods
Saved in:
Bibliographic Details
Main Author: Stefanov, Stefan M. (Author)
Format: Electronic eBook
Language:English
Published: Boston, MA Springer US 2001
Series:Applied Optimization 53
Subjects:
Online Access:Volltext
Item Description: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
Physical Description:1 Online-Ressource (XIX, 314 p)
ISBN:9781475734171
9781441948519
ISSN:1384-6485
DOI:10.1007/978-1-4757-3417-1

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection! Get full text