Separable Programming - Theory and Methods (Hardcover, 2001 ed.)

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.

General

Imprint:	Springer
Country of origin:	Netherlands
Series:	Applied Optimization, 53
Release date:	May 2001
First published:	2001
Authors:	S. M. Stefanov
Dimensions:	235 x 155 x 20mm (L x W x T)
Format:	Hardcover
Pages:	314
Edition:	2001 ed.
ISBN-13:	978-0-7923-6882-3
Categories:	Books > Computing & IT > Computer programming > General Books > Science & Mathematics > Mathematics > Optimization > Linear programming Books > Science & Mathematics > Mathematics > Applied mathematics > General
LSN:	0-7923-6882-7
Barcode:	9780792368823

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!