Skip to main content alibris logo

Interior Point Polynomial Methods in Convex Programming

by ,

Write The First Customer Review
Interior Point Polynomial Methods in Convex Programming - Nesterov, Yurii, and Nemirovskii, Arkadii
Filter Results
Item Condition
Seller Rating
Other Options
Change Currency

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 methods for nonlinear convex programming, efficient computation methods for control problems and variational inequalities, and acceleration of path-following methods are covered. The authors describe the first unified theory of ...

loading
Interior Point Polynomial Methods in Convex Programming 1987, Society for Industrial & Applied Mathematics,U.S., New York

ISBN-13: 9780898715156

Trade paperback