Carte Interior Point Polynomial Methods in Convex Programming Yurii  NesterovArkadii Nemirovskii

Interior Point Polynomial Methods in Convex Programming

Limbă: engleză
Legare: Carte broșată
Disponibilitate: șansă 50%
Şanse de a obține acest titlu
786.96 lei
Written for specialists working in optimization, mathematical programming, or control theory. The ge...

Informații despre carte

Limbă
engleză
Legare
Carte - Carte broșată
Publicat
2006
Pagini
414
EAN
9780898715156
ISBN
0898715156
Enbook ID
02050131
Greutate
852
Dimensiuni
177 x 256 x 26

Descriere completă

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.

S-ar putea să te intereseze

812.05 lei

Best of Classic Driver

J Philip Rathgen
397.83 lei

Krav Maga

Gershon Ben Keren
104.66 lei
105.26 lei
78.97 lei
201.74 lei
119.42 lei
84.43 lei
119.42 lei
143.80 lei

Ion-Solid Interactions

Michael Nastasi
695.35 lei

Cicero: Pro P. Sulla oratio

Marcus Tullius CiceroDominic H. Berry
214.18 lei

Christine Streuli

Fanni Fetzer
270.00 lei

Clienții care au cumpărat această carte au mai cumpărat și

103.34 lei
292.96 lei

Bloom

KEVIN PANETTA
125.08 lei
152.69 lei

Havran

Marta Mokrá
7.17 lei
35.99 lei
87.97 lei