Zum Hauptinhalt springen Zur Suche springen Zur Hauptnavigation springen
Dekorationsartikel gehören nicht zum Leistungsumfang.
Nonlinear Conjugate Gradient Methods for Unconstrained Optimization
Taschenbuch von Neculai Andrei
Sprache: Englisch

126,95 €*

-15 % UVP 149,79 €
inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 2-4 Werktage

Produkt Anzahl: Gib den gewünschten Wert ein oder benutze die Schaltflächen um die Anzahl zu erhöhen oder zu reduzieren.
Kategorien:
Beschreibung
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.
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.
Über den Autor
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).
Zusammenfassung

An explicit and thorough treatment of the conjugate gradient algorithms for unconstrained optimization properties and convergence

A clear illustration of the numerical performances of the algorithms described in the book

Provides a deep analysis of the performances of the algorithms

Maximizes the reader's insight into the implementation of the conjugate gradient methods in professional computing programs

Inhaltsverzeichnis
1. Introduction.- 2. Linear Conjugate Gradient Algorithm.- 3. General Convergence Results for Nonlinear Conjugate Gradient Methods.- 4. Standard Conjugate Gradient Methods.- 5. Acceleration of Conjugate Gradient Algorithms.- 6. Hybrid and Parameterized Conjugate Gradient Methods.- 7. Conjugate Gradient Methods as Modifications of the Standard Schemes.- 8. Conjugate Gradient Methods Memoryless BFGS Preconditioned.- 9. Three-Term Conjugate Gradient Methods.- 10. Other Conjugate Gradient Methods.- 11. Discussion and Conclusions.- References.- Author Index.- Subject Index.
Details
Erscheinungsjahr: 2021
Fachbereich: Allgemeines
Genre: Mathematik, Medizin, Naturwissenschaften, Technik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Inhalt: xxviii
498 S.
3 s/w Illustr.
90 farbige Illustr.
498 p. 93 illus.
90 illus. in color.
ISBN-13: 9783030429522
ISBN-10: 3030429520
Sprache: Englisch
Einband: Kartoniert / Broschiert
Autor: Andrei, Neculai
Auflage: 1st edition 2020
Hersteller: Springer International Publishing
Springer International Publishing AG
Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, D-69121 Heidelberg, juergen.hartmann@springer.com
Maße: 235 x 155 x 29 mm
Von/Mit: Neculai Andrei
Erscheinungsdatum: 24.06.2021
Gewicht: 0,791 kg
Artikel-ID: 120145819
Über den Autor
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).
Zusammenfassung

An explicit and thorough treatment of the conjugate gradient algorithms for unconstrained optimization properties and convergence

A clear illustration of the numerical performances of the algorithms described in the book

Provides a deep analysis of the performances of the algorithms

Maximizes the reader's insight into the implementation of the conjugate gradient methods in professional computing programs

Inhaltsverzeichnis
1. Introduction.- 2. Linear Conjugate Gradient Algorithm.- 3. General Convergence Results for Nonlinear Conjugate Gradient Methods.- 4. Standard Conjugate Gradient Methods.- 5. Acceleration of Conjugate Gradient Algorithms.- 6. Hybrid and Parameterized Conjugate Gradient Methods.- 7. Conjugate Gradient Methods as Modifications of the Standard Schemes.- 8. Conjugate Gradient Methods Memoryless BFGS Preconditioned.- 9. Three-Term Conjugate Gradient Methods.- 10. Other Conjugate Gradient Methods.- 11. Discussion and Conclusions.- References.- Author Index.- Subject Index.
Details
Erscheinungsjahr: 2021
Fachbereich: Allgemeines
Genre: Mathematik, Medizin, Naturwissenschaften, Technik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Inhalt: xxviii
498 S.
3 s/w Illustr.
90 farbige Illustr.
498 p. 93 illus.
90 illus. in color.
ISBN-13: 9783030429522
ISBN-10: 3030429520
Sprache: Englisch
Einband: Kartoniert / Broschiert
Autor: Andrei, Neculai
Auflage: 1st edition 2020
Hersteller: Springer International Publishing
Springer International Publishing AG
Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, D-69121 Heidelberg, juergen.hartmann@springer.com
Maße: 235 x 155 x 29 mm
Von/Mit: Neculai Andrei
Erscheinungsdatum: 24.06.2021
Gewicht: 0,791 kg
Artikel-ID: 120145819
Sicherheitshinweis

Ähnliche Produkte

Ähnliche Produkte