Separable Programming

Separable Programming : Theory and Methods

4 (1 rating by Goodreads)
By (author) 

Free delivery worldwide

Available. Dispatched from the UK in 3 business days
When will my order arrive?

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.
show more

Product details

  • Hardback | 314 pages
  • 157.5 x 241.3 x 22.9mm | 635.04g
  • Dordrecht, Netherlands
  • English
  • 2001 ed.
  • XIX, 314 p.
  • 0792368827
  • 9780792368823

Table of contents

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.
show more

Rating details

1 ratings
4 out of 5 stars
5 0% (0)
4 100% (1)
3 0% (0)
2 0% (0)
1 0% (0)
Book ratings by Goodreads
Goodreads is the world's largest site for readers with over 50 million reviews. We're featuring millions of their reader ratings on our book pages to help you find your new favourite book. Close X