Live briefing
Everything about Conjugate gradient method
Mathematical optimization algorithm
In mathematics, the conjugate gradient method is an algorithm for the numerical solution of particular systems of linear equations, namely those whose matrix is positive-semidefinite. The conjugate gradient method is often implemented as an iterative algorithm, applicable to sparse systems that are too large to be handled by a direct implementation or other direct methods such as the Cholesky decomposition. Large sparse systems often arise when numerically solving partial differential equations or optimization problems. Wikipedia →
đź§ Start here: a 6-step reading path
- Read the overview: Conjugate gradient methodA 5-minute orientation
- Skim a recent paper: An efficient hybrid conjugate gradient method for unconstrained optimizationInfluential work since 2022
- Pick up a classic book: Conjugate gradient type methods for ill-posed problemsThe most-reprinted book on the subject
- Read the landmark paper: Restart procedures for the conjugate gradient methodCited 1,379 times
- Go sideways: Biconjugate gradient methodA closely related topic
- Go sideways: Anderson accelerationA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
- Description of the problem addressed by conjugate gradients
- Derivation as a direct method
- As an iterative method
- Finite Termination Property
- Convergence properties
- The preconditioned conjugate gradient method
- The flexible preconditioned conjugate gradient method
- Vs. the locally optimal steepest descent method
- Conjugate gradient method as optimal feedback controller for double integrator
- Conjugate gradient on the normal equations
- Conjugate gradient method for complex Hermitian matrices
- Advantages and disadvantages
🏆 Landmark papers (most cited)
Restart procedures for the conjugate gradient method
The conjugate gradient method in extremal problems
Block Preconditioning for the Conjugate Gradient Method
Conjugate gradient method
Tomographic inversion via the conjugate gradient method
A generalized conjugate gradient, least square method
The Limited Memory Conjugate Gradient Method
A modified PRP conjugate gradient method
🆕 Influential since 2022
An efficient hybrid conjugate gradient method for unconstrained optimization
A hybrid Riemannian conjugate gradient method for nonconvex optimization problems
A HYBRID CONJUGATE GRADIENT METHOD FOR UNCONSTRAINED OPTIMIZATION WITH APPLICATION
A novel hybrid conjugate gradient method for multiobjective optimization problems
Global convergence of Hager–Zhang type Riemannian conjugate gradient method
📚 Books worth reading
Conjugate gradient type methods for ill-posed problemsMartin Hanke · 1995- 📕Preconditioned conjugate-gradient methods for low-speed flow calculationsKumud Ajmani · 1993
- 📕Multi-color incomplete Cholesky conjugate gradient methods for vector computersEugene L. Poole · 1986
Krylov subspace methods for solving large unsymmetric linear systemsY. Saad · 1981- 📕Optimal control of chemical processesChing-Ping Chen · 1987
- 📕A finite element-boundary integral method for electromagnetic scatteringJeffery David Collins · 1992
- 📕Aerodynamic shape sensitivity analysis and design optimization of complex configurations using unstructured gridsJ. C. Newman · 1997
- 📕A taxonomy for conjugate gradient methodsSteven F. Ashby · 1988
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Biconjugate gradient method In mathematics, more specifically in numerical linear algebra, the biconjugate gradient method is an algorithm to solve systems of linear equations Ax=b…
- Anderson acceleration In mathematics, Anderson acceleration, also called Anderson mixing, is a method for the acceleration of the convergence rate of fixed-point iterations…
- Iterative method In computational mathematics, an iterative method is a mathematical procedure that uses an initial value to generate a sequence of improving approximate…
- Barzilai–Borwein method The Barzilai–Borwein method is an iterative gradient descent method for unconstrained optimization using either of two step sizes derived from the linear…
- Gradient descent Gradient descent is a method for unconstrained mathematical optimization. It is a first-order iterative algorithm for minimizing a differentiable multivariate…
- Preconditioner In mathematics, preconditioning is the application of a transformation, called the preconditioner, that conditions a given problem into a form that is…
- Newton's method in optimization In calculus, Newton's method (also called Newton–Raphson) is an iterative method for finding the roots of a differentiable function f, which are solutions…
- Gauss–Newton algorithm In numerical methods, the Gauss–Newton algorithm is an iterative algorithm to solve non-linear least squares problems. It is an extension of Newton's method…