Interior Point Polynomial Algorithms in Convex Programming (Studies in Applied and Numerical Mathematics, Series Number 13) - Softcover
Synopsis
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.
"synopsis" may belong to another edition of this title.
About the Author
Yurii Nesterov is Senior Research Associate at the Central Economic and Mathematical Institute, Moscow.
Arkadii Nemirovskii is Leading Research Associate at the Central Economic and Mathematical Institute, Moscow.
"About this title" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Interior Point Polynomial Algorithms in Convex Programming...
Stock Image
Interior Point Polynomial Algorithms in Convex Programming
Published by
Society for Industrial & Applied Mathematics,U.S., 1995
ISBN 10: 0898715156
ISBN 13: 9780898715156
New
Softcover
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Seller rating 5 out of 5 stars
Condition: New. 1995. Paperback. . . . . . Seller Inventory # V9780898715156
Buy New
US$ 167.94
US$ 12.20 shipping
Ships from Ireland to U.S.A.
Ships from Ireland to U.S.A.
Quantity: 1 available
Seller Image
Interior Point Polynomial Methods in Convex Programming
Published by
Society for Industrial and Applied Mathematics,U.S., US, 2006
ISBN 10: 0898715156
ISBN 13: 9780898715156
New
Paperback
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. 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.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.The book contains new and important results in the general theory of convex programming, e.g., their ""conic"" problem formulation in which duality theory is completely symmetric. For each algorithm described, the authors carefully derive precise bounds on the computational effort required to solve a given family of problems to a given precision. In several cases they obtain better problem complexity estimates than were previously known. Several of the new algorithms described in this book, e.g., the projective method, have been implemented, tested on ""real world"" problems, and found to be extremely efficient in practice.Special Features:The developed theory of polynomial methods covers all approaches known so far.Presents detailed descriptions of algorithms for many important classes of nonlinear problems. Seller Inventory # LU-9780898715156
Buy New
US$ 182.69
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Stock Image
Interior Point Polynomial Algorithms in Convex Programming
Published by
Society for Industrial & Applied, 2006
ISBN 10: 0898715156
ISBN 13: 9780898715156
New
Paperback
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. 415 pages. 9.50x6.75x1.00 inches. In Stock. Seller Inventory # __0898715156
Buy New
US$ 172.02
US$ 16.77 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 2 available
Stock Image
Interior Point Polynomial Algorithms in Convex Programming
Published by
Society for Industrial & Applied Mathematics,U.S., 1987
ISBN 10: 0898715156
ISBN 13: 9780898715156
New
Softcover
Seller: Kennys Bookstore, Olney, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. 1995. Paperback. . . . . . Books ship from the US and Ireland. Seller Inventory # V9780898715156
Stock Image
Interior Point Polynomial Methods in Convex Programming
Published by
Society for Industrial & Applied Mathematics,U.S., 1987
ISBN 10: 0898715156
ISBN 13: 9780898715156
New
Paperback
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. New copy - Usually dispatched within 4 working days. Seller Inventory # B9780898715156
Buy New
US$ 181.86
US$ 26.26 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Seller Image
Interior Point Polynomial Methods in Convex Programming
Published by
Society for Industrial and Applied Mathematics,U.S., US, 2006
ISBN 10: 0898715156
ISBN 13: 9780898715156
New
Paperback
Seller: Rarewaves.com UK, London, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. 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.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.The book contains new and important results in the general theory of convex programming, e.g., their ""conic"" problem formulation in which duality theory is completely symmetric. For each algorithm described, the authors carefully derive precise bounds on the computational effort required to solve a given family of problems to a given precision. In several cases they obtain better problem complexity estimates than were previously known. Several of the new algorithms described in this book, e.g., the projective method, have been implemented, tested on ""real world"" problems, and found to be extremely efficient in practice.Special Features:The developed theory of polynomial methods covers all approaches known so far.Presents detailed descriptions of algorithms for many important classes of nonlinear problems. Seller Inventory # LU-9780898715156
Buy New
US$ 177.87
US$ 87.21 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available