Interior Point Polynomial Algorithms in Convex Programming

Nesterov, Yurii/ Nemirovskii, Arkadii

ISBN 10: 0898715156 / ISBN 13: 9780898715156

Published by Society for Industrial & Applied, 2006

About this Item

415 pages. 9.50x6.75x1.00 inches. In Stock.

Seller Inventory # __0898715156

Bibliographic Details

• Title: Interior Point Polynomial Algorithms in Convex Programming
• Publisher: Society for Industrial & Applied
• Publication Date: 2006
• Language: English
• ISBN 10: 0898715156
• ISBN 13: 9780898715156
• Binding: Paperback
• Condition: Brand New

About this title

Synopsis

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.

About the Author

Yurii Nesterov is Senior Research Associate at the Central Economic and Mathematical Institute, Moscow.

Arkadii Nemirovskii is Leading Research Associate at the Central Economic and Mathematical Institute, Moscow.