Taschenbuch. Condizione: 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. Codice articolo 9783030429522

Contatta il venditore

Compra nuovo

EUR 149,79

Convertire valuta

Spese di spedizione: EUR 23,00

Da: Germania a: U.S.A.

Destinazione, tempi e costi

Quantit�: 2 disponibili

Aggiungi al carrello

Immagini fornite dal venditore

Nonlinear Conjugate Gradient Methods for Unconstrained Optimization

Andrei, Neculai

Editore: Springer, Berlin|Springer, 2021

ISBN 10: 3030429520 ISBN 13: 9783030429522

Nuovo Kartoniert / Broschiert

Da: moluna, Greven, Germania

Valutazione del venditore 5 su 5 stelle

Kartoniert / Broschiert. Condizione: New. Codice articolo 476474111

Contatta il venditore

Compra nuovo

EUR 127,40

Convertire valuta

Spese di spedizione: EUR 48,99

Da: Germania a: U.S.A.

Destinazione, tempi e costi

Quantit�: Pi� di 20 disponibili

Aggiungi al carrello

Immagini fornite dal venditore

Nonlinear Conjugate Gradient Methods for Unconstrained Optimization

Neculai Andrei

Editore: Springer International Publishing, 2021

ISBN 10: 3030429520 ISBN 13: 9783030429522

Nuovo Taschenbuch

Da: AHA-BUCH GmbH, Einbeck, Germania

Valutazione del venditore 5 su 5 stelle

Taschenbuch. Condizione: 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. Codice articolo 9783030429522

Contatta il venditore