Interior Point Polynomial Algorithms in Convex Programming

Yurii Nesterov

ISBN 10: 0898715156 / ISBN 13: 9780898715156

Editore: Society for Industrial & Applied Mathematics,U.S., 1987

Riguardo questo articolo

1995. Paperback. . . . . . Books ship from the US and Ireland.

Codice articolo V9780898715156

Dati bibliografici

• Titolo: Interior Point Polynomial Algorithms in Convex Programming
• Editore: Society for Industrial & Applied Mathematics,U.S.
• Data di pubblicazione: 1987
• Lingua: Inglese
• ISBN 10: 0898715156
• ISBN 13: 9780898715156
• Rilegatura: Brossura
• Condizione: New

Descrizione articolo

Riassunto

In this book, the authors describe the first unified theory of polynomial-time interior-point methods.

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.