Separable Programming Theory and Methods

Author(s): S.M. Stefanov
Publisher: Springer
ISBN: 9780792368823
Edition:

$39,99

Delivery: This can be downloaded Immediately after purchasing.
Version: Only PDF Version.
Compatible Devices: Can be read on any device (Kindle, NOOK, Android/IOS devices, Windows, MAC)
Quality: High Quality. No missing contents. Printable

Recommended Software: Check here

Important: No Access Code

Description

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.