Call Boomerang Books 1300 36 33 32

Get Latest Book News + FREE Shipping. Subscribe to the Boomerang Books Bulletin eNewsletter right now!

Description - Interior Point Polynomial Algorithms in Convex Programming by 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, 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 wide variety of problems beyond the traditional linear and quadratic programs.

Buy Interior Point Polynomial Algorithms in Convex Programming by Yurii Nesterov from Australia's Online Independent Bookstore, Boomerang Books.

Book Details

ISBN: 9780898715156
ISBN-10: 0898715156
Format: Paperback
(228mm x 152mm x 25mm)
Pages: 415
Imprint: Society for Industrial & Applied Mathematics,U.S.
Publisher: Society for Industrial & Applied Mathematics,U.S.
Publish Date: 1-Jan-1987
Country of Publication: United States

Book Reviews - Interior Point Polynomial Algorithms in Convex Programming by Yurii Nesterov

» Have you read this book? We'd like to know what you think about it - write a review about Interior Point Polynomial Algorithms in Convex Programming book by Yurii Nesterov and you'll earn 50c in Boomerang Bucks loyalty dollars (you must be a Boomerang Books Account Holder - it's free to sign up and there are great benefits!)

Write Review