Interior-point Polynomial Algorithms in Convex Programming

Nesterov, Yurii; Nemirovskii, Arkadii

ISBN 10: 0898715156 / ISBN 13: 9780898715156

Editore: Society for Industrial and Applied Mathematics, 1987

Riguardo questo articolo

Codice articolo 4875165-n

Dati bibliografici

Titolo: Interior-point Polynomial Algorithms in ...

Casa editrice: Society for Industrial and Applied Mathematics

Data di pubblicazione: 1987

Legatura: Brossura

Condizione: New

Descrizione articolo

Riassunto:

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.

Contenuti:

1. Self-concordant functions and Newton method; 2. Path-following interior-point methods; 3. Potential Reduction interior-point methods; 4. How to construct self- concordant barriers; 5. Applications in convex optimization; 6.Variational inequalities with monotone operators; 7. Acceleration for linear and linearly constrained quadratic problems; Bibliography; Appendix 1; Appendix 2.