Interior Point Polynomial Algorithms in Convex Programming - Nesterov, Yurii; Nemirovskii, Arkadii
140,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in über 4 Wochen
payback
70 °P sammeln
  • Broschiertes Buch

In this book, the authors describe the first unified theory of polynomial-time interior-point methods.
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 analysed. This approach yields polynomial-time interior-point methods for a wide variety of problems beyond the traditional linear and quadratic programs.

Andere Kunden interessierten sich auch für
Produktbeschreibung
In this book, the authors describe the first unified theory of polynomial-time interior-point methods.
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 analysed. This approach yields polynomial-time interior-point methods for a wide variety of problems beyond the traditional linear and quadratic programs.