Kniha Interior Point Polynomial Methods in Convex Programming Yurii  NesterovArkadii Nemirovskii

Interior Point Polynomial Methods in Convex Programming

Jazyk: Angličtina
Vazba: Brožovaná
Dostupnost: 50 % šance
Prohledáme celý svět
3 311
Written for specialists working in optimization, mathematical programming, or control theory. The ge...

Informace o knize

Jazyk
Angličtina
Vazba
Kniha - Brožovaná
Vydáno
2006
Stránek
414
EAN
9780898715156
ISBN
0898715156
Enbook ID
02050131
Hmotnost
852
Rozměry
177 x 256 x 26

Kompletní popis

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.

Mohlo by vás zajímat

3 347

Best of Classic Driver

J Philip Rathgen
1 629

Krav Maga

Gershon Ben Keren
482
433
340
351
515
570

Ion-Solid Interactions

Michael Nastasi
2 920

Cicero: Pro P. Sulla oratio

Marcus Tullius CiceroDominic H. Berry
899

Christine Streuli

Fanni Fetzer
1 244

Zákaznicí kteří koupili tuto knihu koupili také

414
1 200

Bloom

KEVIN PANETTA
576
630

Havran

Marta Mokrá
33
142
405