Könyv Interior Point Polynomial Methods in Convex Programming Yurii  NesterovArkadii Nemirovskii

Interior Point Polynomial Methods in Convex Programming

Nyelv: Angol
Kötés: Puha kötésű
Elérhetőség: 50 % esély
Keressük az egész világon
54 507 Ft
Written for specialists working in optimization, mathematical programming, or control theory. The ge...

Információk a könyvről

Nyelv
Angol
Kötés
Könyv - Puha kötésű
Kiadva
2006
oldal
414
EAN
9780898715156
ISBN
0898715156
Enbook ID
02050131
Súly
852
Méretek
177 x 256 x 26

Teljes leírás

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.

Érdekelheti

56 538 Ft

Best of Classic Driver

J Philip Rathgen
26 854 Ft

Krav Maga

Gershon Ben Keren
7 066 Ft
7 348 Ft
5 546 Ft
13 620 Ft
5 855 Ft
8 375 Ft
9 980 Ft

Ion-Solid Interactions

Michael Nastasi
48 194 Ft

Cicero: Pro P. Sulla oratio

Marcus Tullius CiceroDominic H. Berry
14 844 Ft

Christine Streuli

Fanni Fetzer
18 224 Ft

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták

6 980 Ft
20 430 Ft

Bloom

KEVIN PANETTA
8 446 Ft
10 634 Ft

Havran

Marta Mokrá
484 Ft
2 502 Ft
5 945 Ft