You might also like

More about Separable Programming

• Book details
• Synopsis
• Trending among others

You get 293 loyalty points

Book synopsis

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

Book details

Book category Books in English Computing & information technology Computer programming / software development

• Full title: Separable Programming
• Subtitle: Theory and Methods
• Author: S.M. Stefanov
• Language: English
• Binding: Hardback
• Number of pages: 314
• EAN: 9780792368823
• ISBN: 0792368827
• ID: 01396725
• Publisher: Springer Netherlands
• Weight: 653 g
• Dimensions: 235 × 155 × 20 mm
• Published: 2001

Trending among others

---

---

---