Separable Programming: Theory and Methods

· Applied Optimization Libro 53 · Springer Science & Business Media
Ebook
314
pagine
Valutazioni e recensioni non sono verificate  Scopri di più

Informazioni su questo ebook

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.

Valuta questo ebook

Dicci cosa ne pensi.

Informazioni sulla lettura

Smartphone e tablet
Installa l'app Google Play Libri per Android e iPad/iPhone. L'app verrà sincronizzata automaticamente con il tuo account e potrai leggere libri online oppure offline ovunque tu sia.
Laptop e computer
Puoi ascoltare gli audiolibri acquistati su Google Play usando il browser web del tuo computer.
eReader e altri dispositivi
Per leggere su dispositivi e-ink come Kobo e eReader, dovrai scaricare un file e trasferirlo sul dispositivo. Segui le istruzioni dettagliate del Centro assistenza per trasferire i file sugli eReader supportati.