Interior-Point Polynomial Algorithms in Convex Programming
โ Scribed by Iu. E. Nesterov, Arkadii Nemirovskii, Yurii Nesterov
- Publisher
- Soc for Industrial & Applied Math
- Year
- 1994
- Tongue
- English
- Leaves
- 416
- Series
- Siam Studies in Applied Mathematics 13
- Category
- Library
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Written for specialists working in optimization, mathematical programming, or control theory. The general theory of path-following and potential reduction interior point polynomial time methods, interior point methods, interior point methods for linear and quadratic programming, polynomial time
Written for specialists working in optimization, mathematical programming, or control theory. The general theory of path-following and potential reduction interior point polynomial time methods, interior point methods, interior point methods for linear and quadratic programming, polynomial time