Nonlinear Conjugate Gradient Methods for Unconstrained Optimization

Nonlinear Conjugate Gradient Methods for Unconstrained Optimization

English | ISBN: 3030429490 | 2020 | 526 Pages | EPUB, PDF | 36 MB

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 the comparisons 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.

Download:

http://longfiles.com/dbep0qyk53qk/Nonlinear_Conjugate_Gradient_Methods_for_Unconstrained_Optimization.pdf.html

[Fast Download] Nonlinear Conjugate Gradient Methods for Unconstrained Optimization


Related eBooks:
A Student's Guide to Vectors and Tensors
The Origin of Discrete Particles (Series on Knots and Everything
Geometry, Language, And Strategy
Local Geometry of the Fermi Surface
Advances in Architectural Geometry 2010
Multicopter Design and Control Practice
Reactive Flows, Diffusion and Transport: From Experiments via Mathematical Model
Louis Nirenberg - Topics in Nonlinear Functional Analysis
Time Series Analysis
New Theory of Discriminant Analysis After R. Fisher: Advanced Research by the Feature Selection Meth
Fuzzy Multi-Criteria Decision Making: Theory and Applications with Recent Developments
Nonlinear Partial Differential Equations: : Asymptotic Behavior of Solutions and Self-Similar Soluti
Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.