Stock image for illustration purposes only - book cover, edition or condition may vary.
Interior Point Polynomial Algorithms in Convex Programming
Yurii Nesterov
€ 182.56
FREE Delivery in Ireland
Description for Interior Point Polynomial Algorithms in Convex Programming
Paperback.
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. In this book, 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 analyzed; this approach yields polynomial-time interior-point methods for a ... Read more
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. In this book, 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 analyzed; this approach yields polynomial-time interior-point methods for a ... Read more
Product Details
Format
Paperback
Publication date
1995
Publisher
Society for Industrial & Applied Mathematics,U.S. United States
Number of pages
415
Condition
New
Number of Pages
415
Place of Publication
New York, United States
ISBN
9780898715156
SKU
V9780898715156
Shipping Time
Usually ships in 7 to 11 working days
Ref
99-1
Reviews for Interior Point Polynomial Algorithms in Convex Programming