Articles liés à Interior-Point Polynomial Algorithms in Convex Programming
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.
Résultats de recherche pour Interior-Point Polynomial Algorithms in Convex Programming
Image d'archives
Interior-Point Polynomial Algorithms in Convex Programming (Siam Studies in Applied Mathematics)
Edité par
Society for Industrial & Applied, 1994
ISBN 10 : 0898713196
ISBN 13 : 9780898713190
Ancien ou d'occasion
Couverture rigide
Vendeur : Broad Street Books, Branchville, NJ, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : As New. Book is in excellent condition, text is unmarked and pages are tight. N° de réf. du vendeur b23760
Quantité disponible : 1 disponible(s)