Interior-Point Polynomial Algorithms in Convex Programming (Siam Studies in Applied Mathematics, Vol 13) - Iu. E. Nesterov, Arkadii Nemirovskii, Yurii Nesterov, Yurii E. Nesterov, Nemirovskii?, Arkadii? Semenovich (1994)
ISBN 0898713196
Subject Interior-point methods; Convex programming
Publisher Soc for Industrial & Applied Math
Publication Date March 1994
Format Paperback (267 x 191 mm)
Language e
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.
Personal Details
Collection Status In Collection
Index 729
Read It Yes
Links Amazon US
Barnes & Noble
Product Details
LoC Classification QA402.5.N4615 1994
Dewey 519.7/6
Cover Price $98.00
No. of Pages 405