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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
List of Figures. List of Tables. Preface. 1. Preliminaries: Convex Analysis and Convex Programming. Part One: Separable Programming. 2. Introduction. Approximating the Separable Problem. 3. Convex Separable Programming. 4. Separable Programming: A Dynamic Programming Approach. Part Two: Convex Separable Programming with Bounds on the Variables. 5. Statement of the Main Problem. Basic Result. 6. Version One: Linear Equality Constraints. 7. The Algorithms. 8. Version Two: Linear Constraint of the Form `>='. 9. Well-Posedness of Optimization Problems. On the Stability of the Set of Saddle Points of the Lagrangian. 10. Extensions. 11. Applications and Computational Experiments. Part Three: Selected Supplementary Topics and Applications. 12. Approximations with Respect to l1- and lINFINITY-Norms: An Application of Convex Separable Unconstrained Nondifferentiable Optimization. 13. About Projections in the Implementation of Stochastic Quasigradient Methods to Some Probabilistic Inventory Control Problems. The Stochastic Problem of Best Chebyshev Approximation. 14. Integrality of the Knapsack Polytope. Appendices. Bibliography. Index. Notation. List of Statements.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 756824-n
Quantità: Più di 20 disponibili
Da: PBShop.store US, Wood Dale, IL, U.S.A.
HRD. Condizione: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Codice articolo L1-9780792368823
Quantità: Più di 20 disponibili
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
HRD. Condizione: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Codice articolo L1-9780792368823
Quantità: Più di 20 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9780792368823_new
Quantità: Più di 20 disponibili
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Condizione: New. Codice articolo 756824-n
Quantità: Più di 20 disponibili
Da: Rarewaves.com USA, London, LONDO, Regno Unito
Hardback. Condizione: New. 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. Codice articolo LU-9780792368823
Quantità: Più di 20 disponibili
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. 340. Codice articolo 263100204
Quantità: 4 disponibili
Da: Majestic Books, Hounslow, Regno Unito
Condizione: New. Print on Demand pp. 340 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam. Codice articolo 5829107
Quantità: 4 disponibili
Da: Biblios, Frankfurt am main, HESSE, Germania
Condizione: New. PRINT ON DEMAND pp. 340. Codice articolo 183100198
Quantità: 4 disponibili
Da: moluna, Greven, Germania
Gebunden. Condizione: New. 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 dynami. Codice articolo 5969759
Quantità: Più di 20 disponibili