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

Informovať o naskladnení knihy

Viac informácií o knihe Interior Point Polynomial Methods in Convex Programming

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

Nákupom získate 355 bodov

Anotácia knihy

Written for specialists working in optimization, mathematical programming, or control theory. The general theory of path-following and potential reduction interior point polynomial time methods, interior point methods, interior point methods for linear and quadratic programming, polynomial time methods for nonlinear convex programming, efficient computation methods for control problems and variational inequalities, and acceleration of path-following methods are covered. In this book, the authors describe the first unified theory of polynomial-time interior-point methods. Their approach provides a simple and elegant framework in which all known polynomial-time interior-point methods can be explained and analyzed; this approach yields polynomial-time interior-point methods for a wide variety of problems beyond the traditional linear and quadratic programs.

Parametre knihy

Zaradenie knihy Knihy po anglicky Mathematics & science Mathematics Optimization

• Celý názov: Interior Point Polynomial Methods in Convex Programming
• Autor: Yurii NesterovArkadii Nemirovskii
• Jazyk: Angličtina
• Väzba: Brožovaná
• Počet strán: 414
• EAN: 9780898715156
• ISBN: 0898715156
• ID: 02050131
• Nakladateľ: Society for Industrial & Applied Mathematics,U.S.
• Hmotnosť: 852 g
• Rozmery: 256 × 177 × 26 mm
• Dátum vydania: 30. June 2006

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

---

---

---