Interior Point Polynomial Algorithms in Convex Programming - Arkadii Nemirovskii,Yurii Nesterov
-25% koodilla BOOKS
Toimitus 28-34 arkipäivässä
30 päivän palautusoikeus
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.
Kuvaus
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.
Lisätietoja
| Kirjoittaja | Arkadii Nemirovskii, Yurii Nesterov |
|---|---|
| Julkaisija | Society for Industrial and Applied Mathematics (SIAM) |
| Julkaisuvuosi | 1987 |
| Kannen tyyppi | Pehmeäkantinen |
| EAN | 9780898715156 |