Interior-Point Polynomial Algorithms in Convex Programming - Couverture rigide

Nesterov, Yurii

 
9780898713190: Interior-Point Polynomial Algorithms in Convex Programming
Couverture rigide
ISBN 10 : 0898713196 ISBN 13 : 9780898713190
Editeur : Society for Industrial & Applied Mathematics,U.S., 1994

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.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
Society for Industrial & Applied Mathematics,U.S.
Date d'édition
1994
Langue
anglais
ISBN 10 
0898713196
ISBN 13 
9780898713190
Reliure
Relié
Nombre de pages
405
Coordonnées du fabricant
non disponible
Personne responsable
non disponible

Autres éditions populaires du même titre

9780898715156: Interior Point Polynomial Algorithms in Convex Programming

Edition présentée

ISBN 10 :  0898715156 ISBN 13 :  9780898715156
Editeur : Society for Industrial and Appli..., 1987
Couverture souple