Interior Point Polynomial Algorithms in Convex Programming - Arkadii Nemirovskii,Yurii Nesterov
-25% su kodu BOOKS
Pristatymas per 28-34 d.d.
30 dienų grąžinimo politika
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.
Aprašymas
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.
Daugiau informacijos
| Autorius | Arkadii Nemirovskii, Yurii Nesterov |
|---|---|
| Leidėjas | Society for Industrial and Applied Mathematics (SIAM) |
| Išleidimo metai | 1987 |
| Viršelio tipas | Minkšti viršeliai |
| EAN | 9780898715156 |