Interior Point Polynomial Algorithms in Convex Programming - Arkadii Nemirovskii,Yurii Nesterov
-40% koodiga BOOKS
Saadetis 28-34 tööpäeva jooksul
30-päevane tagastamisõigus
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.
Kirjeldus
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.
Lisateave
| Autor | Arkadii Nemirovskii, Yurii Nesterov |
|---|---|
| Kirjastaja | Society for Industrial and Applied Mathematics (SIAM) |
| Väljalaskeaasta | 1987 |
| Kaanetüüp | Pehme kaanega |
| EAN | 9780898715156 |