Mohlo by sa vám tiež páčiť

Viac informácií o knihe Separable Programming

• Parametre knihy
• Anotácia kniha
• Obľúbené z iného súdka

Nákupom získate 293 bodov

Anotácia knihy

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.

Parametre knihy

Zaradenie knihy Books in English Computing & information technology Computer programming / software development

• Celý názov: Separable Programming
• Podnázov: Theory and Methods
• Autor: S.M. Stefanov
• Jazyk: Angličtina
• Väzba: Pevná
• Počet strán: 314
• EAN: 9780792368823
• ISBN: 0792368827
• ID: 01396725
• Nakladateľ: Springer Netherlands
• Hmotnosť: 653 g
• Rozmery: 235 × 155 × 20 mm
• Rok vydania: 2001

Obľúbené z iného súdka

---

---

---