Interior Point Polynomial Algorithms in Convex Programming - Arkadii Nemirovskii,Yurii Nesterov
-30% ar kodu BOOKS
Piegāde 28-34 darba dienu laikā
30 dienu atgriešanas 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.
Vairāk informācijas
| Autors | Arkadii Nemirovskii, Yurii Nesterov |
|---|---|
| Izdevējs | Society for Industrial and Applied Mathematics (SIAM) |
| Izlaides gads | 1987 |
| Vāka tips | Mīkstais vāks |
| EAN | 9780898715156 |