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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
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.Review:
"...the single most important contribution to the literature on optimization in the last decade." -- Aharon Ben-Tal, Professor of Operations Research, Technion-Israel Institute of Technology
"This is an outstanding book, a landmark in the study of complexity in mathematical programming...is likely to become a classic" -- M. J. Todd, Cornell University, Mathematics of Computation, Vol. 65, No. 214, April 1996
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Descrizione libro Soc for Industrial & Applied Math. Hardcover. Condizione libro: New. 0898713196 New Condition. Codice libro della libreria NEW6.3253491