Sinossi
In this book, the authors describe the first unified theory of polynomial-time interior-point methods.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Contenuti
1. Self-concordant functions and Newton method; 2. Path-following interior-point methods; 3. Potential Reduction interior-point methods; 4. How to construct self- concordant barriers; 5. Applications in convex optimization; 6.Variational inequalities with monotone operators; 7. Acceleration for linear and linearly constrained quadratic problems; Bibliography; Appendix 1; Appendix 2.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Altre edizioni note dello stesso titolo
Risultati della ricerca per Interior Point Polynomial Algorithms in Convex Programming
Foto dell'editore
Interior Point Polynomial Algorithms in Convex Programming
Editore:
Society for Industrial & Applied Mathematics,U.S., 1995
ISBN 10: 0898715156
ISBN 13: 9780898715156
Nuovo
Brossura
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Valutazione del venditore 5 su 5 stelle
Condizione: New. 1995. Paperback. . . . . . Codice articolo V9780898715156
Compra nuovo
EUR 140,34
Spedizione EUR 10,50
Spedito da Irlanda a U.S.A.
Spedito da Irlanda a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Interior-point Polynomial Algorithms in Convex Programming
Editore:
Society for Industrial and Applied Mathematics, 1987
ISBN 10: 0898715156
ISBN 13: 9780898715156
Antico o usato
Brossura
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: As New. Unread book in perfect condition. Codice articolo 4875165
Compra usato
EUR 151,16
Spedizione EUR 2,29
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 2 disponibili
Immagini fornite dal venditore
Interior-point Polynomial Algorithms in Convex Programming
Editore:
Society for Industrial and Applied Mathematics, 1987
ISBN 10: 0898715156
ISBN 13: 9780898715156
Nuovo
Brossura
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 4875165-n
Compra nuovo
EUR 157,34
Spedizione EUR 2,29
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 2 disponibili
Foto dell'editore
Interior Point Polynomial Algorithms in Convex Programming
Editore:
Society for Industrial & Applied, 2006
ISBN 10: 0898715156
ISBN 13: 9780898715156
Nuovo
Paperback
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Brand New. 415 pages. 9.50x6.75x1.00 inches. In Stock. Codice articolo __0898715156
Compra nuovo
EUR 148,64
Spedizione EUR 14,49
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 2 disponibili
Immagini fornite dal venditore
Interior Point Polynomial Methods in Convex Programming
Editore:
Society for Industrial and Applied Mathematics,U.S., US, 2006
ISBN 10: 0898715156
ISBN 13: 9780898715156
Nuovo
Paperback
Da: Rarewaves.com USA, London, LONDO, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: 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. Codice articolo LU-9780898715156
Compra nuovo
EUR 163,14
Spedizione gratuita
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Interior-point Polynomial Algorithms in Convex Programming
Editore:
Society for Industrial and Applied Mathematics, 1987
ISBN 10: 0898715156
ISBN 13: 9780898715156
Antico o usato
Brossura
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: As New. Unread book in perfect condition. Codice articolo 4875165
Compra usato
EUR 151,08
Spedizione EUR 17,39
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 2 disponibili
Immagini fornite dal venditore
Interior-point Polynomial Algorithms in Convex Programming
Editore:
Society for Industrial and Applied Mathematics, 1987
ISBN 10: 0898715156
ISBN 13: 9780898715156
Nuovo
Brossura
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 4875165-n
Compra nuovo
EUR 152,31
Spedizione EUR 17,39
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 2 disponibili
Foto dell'editore
Interior Point Polynomial Methods in Convex Programming
Editore:
Society for Industrial & Applied Mathematics,U.S., 1987
ISBN 10: 0898715156
ISBN 13: 9780898715156
Nuovo
Paperback
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: New. New copy - Usually dispatched within 4 working days. Codice articolo B9780898715156
Compra nuovo
EUR 157,13
Spedizione EUR 22,69
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Interior Point Polynomial Algorithms in Convex Programming
Editore:
Society for Industrial & Applied Mathematics,U.S., 1987
ISBN 10: 0898715156
ISBN 13: 9780898715156
Nuovo
Brossura
Da: Kennys Bookstore, Olney, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. 1995. Paperback. . . . . . Books ship from the US and Ireland. Codice articolo V9780898715156
Compra nuovo
EUR 175,78
Spedizione EUR 9,10
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Interior Point Polynomial Methods in Convex Programming
Editore:
Society for Industrial and Applied Mathematics,U.S., US, 2006
ISBN 10: 0898715156
ISBN 13: 9780898715156
Nuovo
Paperback
Da: Rarewaves.com UK, London, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: 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. Codice articolo LU-9780898715156
Compra nuovo
EUR 153,69
Spedizione EUR 75,35
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 1 disponibili