Interior Point Polynomial Algorithms in Convex Programming - Arkadii Nemirovskii,Yurii Nesterov
-20% with code BOOKS
Shipping in 28-34 days
30-day return policy
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.
Description
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.
More Information
| Author | Arkadii Nemirovskii, Yurii Nesterov |
|---|---|
| Publisher | Society for Industrial and Applied Mathematics (SIAM) |
| Release year | 1987 |
| Cover type | Softcover |
| EAN | 9780898715156 |