Nonlinear Conjugate Gradient Methods for Unconstrained Optimization

Nonlinear Conjugate Gradient Methods for Unconstrained Optimization PDF Author: Neculai Andrei
Publisher: Springer Nature
ISBN: 3030429504
Category : Mathematics
Languages : en
Pages : 515

Get Book Here

Book Description
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.

Nonlinear Conjugate Gradient Methods for Unconstrained Optimization

Nonlinear Conjugate Gradient Methods for Unconstrained Optimization PDF Author: Neculai Andrei
Publisher: Springer Nature
ISBN: 3030429504
Category : Mathematics
Languages : en
Pages : 515

Get Book Here

Book Description
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.

Preconditioned Conjugate-Gradient 2 (PCG2), a Computer Program for Solving Ground-water Flow Equations

Preconditioned Conjugate-Gradient 2 (PCG2), a Computer Program for Solving Ground-water Flow Equations PDF Author: Mary Catherine Hill
Publisher:
ISBN:
Category : Groundwater
Languages : en
Pages : 54

Get Book Here

Book Description


Preconditioning and the Conjugate Gradient Method in the Context of Solving PDEs

Preconditioning and the Conjugate Gradient Method in the Context of Solving PDEs PDF Author: Josef Malek
Publisher: SIAM
ISBN: 161197383X
Category : Mathematics
Languages : en
Pages : 106

Get Book Here

Book Description
Preconditioning and the Conjugate Gradient Method in the Context of Solving PDEs?is about the interplay between modeling, analysis, discretization, matrix computation, and model reduction. The authors link PDE analysis, functional analysis, and calculus of variations with matrix iterative computation using Krylov subspace methods and address the challenges that arise during formulation of the mathematical model through to efficient numerical solution of the algebraic problem. The book?s central concept, preconditioning of the conjugate gradient method, is traditionally developed algebraically using the preconditioned finite-dimensional algebraic system. In this text, however, preconditioning is connected to the PDE analysis, and the infinite-dimensional formulation of the conjugate gradient method and its discretization and preconditioning are linked together. This text challenges commonly held views, addresses widespread misunderstandings, and formulates thought-provoking open questions for further research.?

Preconditioned Conjugate Gradient Methods

Preconditioned Conjugate Gradient Methods PDF Author:
Publisher:
ISBN:
Category :
Languages : en
Pages :

Get Book Here

Book Description


Conjugate Gradient Algorithms in Nonconvex Optimization

Conjugate Gradient Algorithms in Nonconvex Optimization PDF Author: Radoslaw Pytlak
Publisher: Springer Science & Business Media
ISBN: 354085634X
Category : Mathematics
Languages : en
Pages : 493

Get Book Here

Book Description
This book details algorithms for large-scale unconstrained and bound constrained optimization. It shows optimization techniques from a conjugate gradient algorithm perspective as well as methods of shortest residuals, which have been developed by the author.

Preconditioned Conjugate Gradient Methods

Preconditioned Conjugate Gradient Methods PDF Author: Owe Axelsson
Publisher: Springer
ISBN: 3540467467
Category : Mathematics
Languages : en
Pages : 204

Get Book Here

Book Description


On Preconditioned Conjugate Gradient Methods

On Preconditioned Conjugate Gradient Methods PDF Author: O. Axelsson
Publisher:
ISBN:
Category :
Languages : en
Pages : 56

Get Book Here

Book Description


Preconditioned Conjugate Gradient Methods

Preconditioned Conjugate Gradient Methods PDF Author:
Publisher:
ISBN:
Category :
Languages : en
Pages : 0

Get Book Here

Book Description


Preconditioned Conjugate Gradient Methods

Preconditioned Conjugate Gradient Methods PDF Author: Owe Axelsson
Publisher:
ISBN: 9783662194171
Category :
Languages : en
Pages : 212

Get Book Here

Book Description


Preconditioning and the Conjugate Gradient Method in the Context of Solving PDEs

Preconditioning and the Conjugate Gradient Method in the Context of Solving PDEs PDF Author: Josef Malek
Publisher: SIAM
ISBN: 1611973848
Category : Mathematics
Languages : en
Pages : 106

Get Book Here

Book Description
Preconditioning and the Conjugate Gradient Method in the Context of Solving PDEs is about the interplay between modeling, analysis, discretization, matrix computation, and model reduction. The authors link PDE analysis, functional analysis, and calculus of variations with matrix iterative computation using Krylov subspace methods and address the challenges that arise during formulation of the mathematical model through to efficient numerical solution of the algebraic problem. The book?s central concept, preconditioning of the conjugate gradient method, is traditionally developed algebraically using the preconditioned finite-dimensional algebraic system. In this text, however, preconditioning is connected to the PDE analysis, and the infinite-dimensional formulation of the conjugate gradient method and its discretization and preconditioning are linked together. This text challenges commonly held views, addresses widespread misunderstandings, and formulates thought-provoking open questions for further research.