Interior Point Polynomial Methods in Convex Programming (Studies in Applied and Numerical Mathematics) - Softcover
Inhaltsangabe
In this book, the authors describe the first unified theory of polynomial-time interior-point methods.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Weitere beliebte Ausgaben desselben Titels
Suchergebnisse für Interior Point Polynomial Methods in Convex Programming...
Beispielbild für diese ISBN
Interior Point Polynomial Algorithms in Convex Programming
Verlag:
Society for Industrial & Applied Mathematics,U.S., 1995
ISBN 10: 0898715156
ISBN 13: 9780898715156
Neu
Softcover
Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irland
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. 1995. Paperback. . . . . . Bestandsnummer des Verkäufers V9780898715156
Neu kaufen
EUR 140,34
EUR 10,50 Versand
Versand von Irland nach USA
Versand von Irland nach USA
Anzahl: 1 verfügbar
Foto des Verkäufers
Interior Point Polynomial Methods in Convex Programming
Verlag:
Society for Industrial and Applied Mathematics,U.S., US, 2006
ISBN 10: 0898715156
ISBN 13: 9780898715156
Neu
Paperback
Anbieter: Rarewaves.com USA, London, LONDO, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: 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. Bestandsnummer des Verkäufers LU-9780898715156
Neu kaufen
EUR 161,97
Versand gratis
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Interior Point Polynomial Algorithms in Convex Programming
Verlag:
Society for Industrial & Applied, 2006
ISBN 10: 0898715156
ISBN 13: 9780898715156
Neu
Paperback
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: Brand New. 415 pages. 9.50x6.75x1.00 inches. In Stock. Bestandsnummer des Verkäufers __0898715156
Neu kaufen
EUR 148,07
EUR 14,44 Versand
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: 2 verfügbar
Beispielbild für diese ISBN
Interior Point Polynomial Methods in Convex Programming
Verlag:
Society for Industrial & Applied Mathematics,U.S., 1987
ISBN 10: 0898715156
ISBN 13: 9780898715156
Neu
Paperback
Anbieter: THE SAINT BOOKSTORE, Southport, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: New. New copy - Usually dispatched within 4 working days. Bestandsnummer des Verkäufers B9780898715156
Neu kaufen
EUR 156,53
EUR 22,60 Versand
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Interior Point Polynomial Algorithms in Convex Programming
Verlag:
Society for Industrial & Applied Mathematics,U.S., 1987
ISBN 10: 0898715156
ISBN 13: 9780898715156
Neu
Softcover
Anbieter: Kennys Bookstore, Olney, MD, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. 1995. Paperback. . . . . . Books ship from the US and Ireland. Bestandsnummer des Verkäufers V9780898715156
Neu kaufen
EUR 174,52
EUR 9,04 Versand
Versand innerhalb von USA
Versand innerhalb von USA
Anzahl: 1 verfügbar
Foto des Verkäufers
Interior Point Polynomial Methods in Convex Programming
Verlag:
Society for Industrial and Applied Mathematics,U.S., US, 2006
ISBN 10: 0898715156
ISBN 13: 9780898715156
Neu
Paperback
Anbieter: Rarewaves.com UK, London, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: 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. Bestandsnummer des Verkäufers LU-9780898715156
Neu kaufen
EUR 153,10
EUR 75,06 Versand
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: 1 verfügbar