Interior Point Polynomial Algorithms in Convex Programming

By Arkadii Nemirovskii and Yurii Nesterov

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,... This description may be from another edition of this product.

• Format: Paperback
• Language: English
• ISBN: 0898715156
• ISBN13: 9780898715156
• Release Date: January 1987
• Publisher: Society for Industrial and Applied Mathematic
• Length: 415 Pages