Articles liés à Nonlinear Conjugate Gradient Methods for Unconstrained...
Synopsis
Two approaches are known for solving large-scale unconstrained optimization problems--the limited-memory quasi-Newton method (truncated Newton method) and the conjugate gradient method. This is the first book to detail conjugate gradient methods, showing their properties and convergence characteristics as well as their performance in solving large-scale unconstrained optimization problems and applications. Comparisons to the limited-memory and truncated Newton methods are also discussed. Topics studied in detail include: linear conjugate gradient methods, standard conjugate gradient methods, acceleration of conjugate gradient methods, hybrid, modifications of the standard scheme, memoryless BFGS preconditioned, and three-term. Other conjugate gradient methods with clustering the eigenvalues or with the minimization of the condition number of the iteration matrix, are also treated. For each method, the convergence analysis, the computational performances and thecomparisons versus other conjugate gradient methods are given.
The theory behind the conjugate gradient algorithms presented as a methodology is developed with a clear, rigorous, and friendly exposition; the reader will gain an understanding of their properties and their convergence and will learn to develop and prove the convergence of his/her own methods. Numerous numerical studies are supplied with comparisons and comments on the behavior of conjugate gradient algorithms for solving a collection of 800 unconstrained optimization problems of different structures and complexities with the number of variables in the range [1000,10000]. The book is addressed to all those interested in developing and using new advanced techniques for solving unconstrained optimization complex problems. Mathematical programming researchers, theoreticians and practitioners in operations research, practitioners in engineering and industry researchers, as well as graduate students in mathematics, Ph.D. and master students in mathematical programming, will find plenty of information and practical applications for solving large-scale unconstrained optimization problems and applications by conjugate gradient methods.Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
À propos de l?auteur
Neculai Andrei holds a position at the Center for Advanced Modeling and Optimization at the Academy of Romanian Scientists in Bucharest, Romania. Dr. Andrei's areas of interest include mathematical modeling, linear programming, nonlinear optimization, high performance computing, and numerical methods in mathematical programming. In addition to this present volume, Neculai Andrei has published 2 books with Springer including Continuous Nonlinear Optimization for Engineering Applications in GAMS Technology (2017) and Nonlinear Optimization Applications Using the GAMS Technology (2013).
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 127,40
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délais
Résultats de recherche pour Nonlinear Conjugate Gradient Methods for Unconstrained...
Image fournie par le vendeur
Nonlinear Conjugate Gradient Methods for Unconstrained Optimization
Edité par
Springer, Berlin|Springer, 2021
ISBN 10 : 3030429520
ISBN 13 : 9783030429522
Neuf
Kartoniert / Broschiert
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Kartoniert / Broschiert. Etat : New. N° de réf. du vendeur 476474111
Quantité disponible : Plus de 20 disponibles
Image d'archives
Nonlinear Conjugate Gradient Methods for Unconstrained Optimization (Springer Optimization and Its Applications, 158)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9783030429522_new
Quantité disponible : Plus de 20 disponibles
Image d'archives
NONLINEAR CONJUGATE GRADIENT METHODS FOR UNCONSTRAINED OPTIMIZATION (PB 2020)
Vendeur : UK BOOKS STORE, London, LONDO, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Brand New! Fast Delivery US Edition and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 7-10 days and we do have flat rate for up to 2LB. Extra shipping charges will be requested if the Book weight is more than 5 LB. This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability. N° de réf. du vendeur CBS 9783030429522
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Nonlinear Conjugate Gradient Methods for Unconstrained Optimization
Edité par
Springer International Publishing, 2021
ISBN 10 : 3030429520
ISBN 13 : 9783030429522
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - Two approaches are knownfor solvinglarge-scaleunconstrained optimization problems-the limited-memory quasi-Newton method (truncated Newton method) and the conjugate gradient method. This is the first book to detail conjugate gradient methods, showing their properties and convergence characteristics as well as their performance in solving large-scale unconstrained optimization problems and applications. Comparisons to the limited-memory and truncated Newton methods are also discussed. Topics studied in detail include: linear conjugate gradient methods, standard conjugate gradient methods, acceleration of conjugate gradient methods, hybrid, modifications of the standard scheme, memoryless BFGS preconditioned, and three-term. Other conjugate gradient methods with clustering the eigenvalues or with the minimization of the condition number of the iteration matrix, are also treated. For each method, the convergence analysis, the computational performances and thecomparisons versus other conjugate gradient methods are given. The theory behind the conjugate gradient algorithms presented as a methodology is developed with a clear, rigorous, and friendly exposition; the reader will gain an understanding of their properties and their convergence and will learn to develop and prove the convergence of his/her own methods. Numerous numerical studies are supplied with comparisons and comments on the behavior of conjugate gradient algorithms for solving a collection of 800 unconstrained optimization problems of different structures and complexities with the number of variables in the range [1000,10000]. The book is addressed to all those interested in developing and using new advanced techniques for solving unconstrained optimization complex problems. Mathematical programming researchers, theoreticians and practitioners in operations research, practitioners in engineering and industry researchers, as well as graduate students in mathematics, Ph.D. and master students in mathematical programming, will find plenty of information and practical applications for solving large-scale unconstrained optimization problems and applications by conjugate gradient methods. N° de réf. du vendeur 9783030429522
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Nonlinear Conjugate Gradient Methods for Unconstrained Optimization
Edité par
Springer International Publishing Jun 2021, 2021
ISBN 10 : 3030429520
ISBN 13 : 9783030429522
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Two approaches are knownfor solvinglarge-scaleunconstrained optimization problems-the limited-memory quasi-Newton method (truncated Newton method) and the conjugate gradient method. This is the first book to detail conjugate gradient methods, showing their properties and convergence characteristics as well as their performance in solving large-scale unconstrained optimization problems and applications. Comparisons to the limited-memory and truncated Newton methods are also discussed. Topics studied in detail include: linear conjugate gradient methods, standard conjugate gradient methods, acceleration of conjugate gradient methods, hybrid, modifications of the standard scheme, memoryless BFGS preconditioned, and three-term. Other conjugate gradient methods with clustering the eigenvalues or with the minimization of the condition number of the iteration matrix, are also treated. For each method, the convergence analysis, the computational performances and thecomparisons versus other conjugate gradient methods are given. The theory behind the conjugate gradient algorithms presented as a methodology is developed with a clear, rigorous, and friendly exposition; the reader will gain an understanding of their properties and their convergence and will learn to develop and prove the convergence of his/her own methods. Numerous numerical studies are supplied with comparisons and comments on the behavior of conjugate gradient algorithms for solving a collection of 800 unconstrained optimization problems of different structures and complexities with the number of variables in the range [1000,10000]. The book is addressed to all those interested in developing and using new advanced techniques for solving unconstrained optimization complex problems. Mathematical programming researchers, theoreticians and practitioners in operations research, practitioners in engineering and industry researchers, as well as graduate students in mathematics, Ph.D. and master students in mathematical programming, will find plenty of information and practical applications for solving large-scale unconstrained optimization problems and applications by conjugate gradient methods. 528 pp. Englisch. N° de réf. du vendeur 9783030429522
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Nonlinear Conjugate Gradient Methods for Unconstrained Optimization
ISBN 10 : 3030429520
ISBN 13 : 9783030429522
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Neuware -Two approaches are known for solving large-scale unconstrained optimization problems¿the limited-memory quasi-Newton method (truncated Newton method) and the conjugate gradient method. This is the first book to detail conjugate gradient methods, showing their properties and convergence characteristics as well as their performance in solving large-scale unconstrained optimization problems and applications. Comparisons to the limited-memory and truncated Newton methods are also discussed. Topics studied in detail include: linear conjugate gradient methods, standard conjugate gradient methods, acceleration of conjugate gradient methods, hybrid, modifications of the standard scheme, memoryless BFGS preconditioned, and three-term. Other conjugate gradient methods with clustering the eigenvalues or with the minimization of the condition number of the iteration matrix, are also treated. For each method, the convergence analysis, the computational performances and thecomparisons versus other conjugate gradient methods are given.The theory behind the conjugate gradient algorithms presented as a methodology is developed with a clear, rigorous, and friendly exposition; the reader will gain an understanding of their properties and their convergence and will learn to develop and prove the convergence of his/her own methods. Numerous numerical studies are supplied with comparisons and comments on the behavior of conjugate gradient algorithms for solving a collection of 800 unconstrained optimization problems of different structures and complexities with the number of variables in the range [1000,10000]. The book is addressed to all those interested in developing and using new advanced techniques for solving unconstrained optimization complex problems. Mathematical programming researchers, theoreticians and practitioners in operations research, practitioners in engineering and industry researchers, as well as graduate students in mathematics, Ph.D. and master students in mathematical programming, will find plenty of information and practical applications for solving large-scale unconstrained optimization problems and applications by conjugate gradient methods.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 528 pp. Englisch. N° de réf. du vendeur 9783030429522
Quantité disponible : 2 disponible(s)
Image d'archives
NONLINEAR CONJUGATE GRADIENT METHODS FOR UNCONSTRAINED OPTIMIZATION (PB 2020)
Vendeur : URW Books Store, CASPER, WY, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : Brand New. Brand New! Fast Delivery, Delivery With In 7-10 working Day Only , USA Edition Original Edition. Excellent Quality, Printing In English Language, Quick delivery by FEDEX & DHL. USPS & UPS Act. Our courier service is not available at PO BOX& APO BOX. Ship from India & United States. N° de réf. du vendeur CBSBOOKS49496
Quantité disponible : 1 disponible(s)
Image d'archives
Nonlinear Conjugate Gradient Methods for Unconstrained Optimization : 158
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. N° de réf. du vendeur 26388602657
Quantité disponible : 4 disponible(s)
Image d'archives
Nonlinear Conjugate Gradient Methods for Unconstrained Optimization : 158
impression à la demandeVendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Print on Demand. N° de réf. du vendeur 392045822
Quantité disponible : 4 disponible(s)
Image d'archives
Nonlinear Conjugate Gradient Methods for Unconstrained Optimization : 158
impression à la demandeVendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. PRINT ON DEMAND. N° de réf. du vendeur 18388602667
Quantité disponible : 4 disponible(s)