Noch Fragen? 0800 / 33 82 637

Separable Optimization

Theory and Methods

Produktform: Buch / Einband - fest (Hardcover)

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 I and I norms, as a convex separable nonsmooth unconstrained minimization problem, is considered as well. Advanced undergraduate and graduate students, mathematical programming/ operations research specialists.weiterlesen

Dieser Artikel gehört zu den folgenden Serien

Sprache(n): Englisch

ISBN: 978-3-030-78400-3 / 978-3030784003 / 9783030784003

Verlag: Springer International Publishing

Erscheinungsdatum: 26.11.2021

Seiten: 356

Auflage: 2

Autor(en): Stefan M. Stefanov

139,09 € inkl. MwSt.
kostenloser Versand

lieferbar - Lieferzeit 10-15 Werktage

zurück