Interior Point Polynomial Algorithms in Convex Programming - Couverture souple

Nesterov, Yurii; Nemirovskii, Arkadii

Couverture souple

ISBN 10 : 0898715156 ISBN 13 : 9780898715156

Editeur : Society for Industrial and Applied Mathematics, 1987

Synopsis

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

A propos du livre

Présentation de l'éditeur

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.

Détails de l'édition

• Éditeur: Society for Industrial and Applied Mathematics
• Date d'édition: 1987
• Langue: anglais
• ISBN 10: 0898715156
• ISBN 13: 9780898715156
• Reliure: Broché
• Nombre de pages: 415
• Coordonnées du fabricant: Cambridge University Press; https://www.cambridge.org/; ; Via Honduras,15; Pomezia; Italia; 71; Italie