Zobacz książki o podobnej tematyce

Więcej informacji o Separable Programming

• Dane szczegółowe
• Opis
• Ulubione w innej kategorii

Za ten zakup dostaniesz 345 punkty

Opis

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.

Szczegóły książki

Kategoria Knihy po anglicky Computing & information technology Computer programming / software development

• Pełny tytuł: Separable Programming
• Podtytuł: Theory and Methods
• Autor: S.M. Stefanov
• Język: Angielski
• Oprawa: Twarda
• Liczba stron: 314
• EAN: 9780792368823
• ISBN: 0792368827
• ID: 01396725
• Wydawca: Springer Netherlands
• Waga: 653 g
• Wymiary: 235 × 155 × 20 mm
• Rok wydania: 2001

Ulubione w innej kategorii

---

---

---