The Limited Memory Conjugate Gradient Method
From MaRDI portal
Recommendations
- An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization
- scientific article; zbMATH DE number 7313238
- A limited memory descent Perry conjugate gradient method
- A conjugate directions approach to improve the limited-memory BFGS method
- Modifications of the limited-memory BFGS method based on the idea of conjugate directions.
- A new conjugate gradient method with an efficient memory structure
- Convergence of a memory gradient method with a curve search rule
- Efficient generalized conjugate gradient algorithms. II: Implementation
- scientific article; zbMATH DE number 3994938
Cited in
(72)- An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition
- Speeding up the convergence of the Polyak's heavy ball algorithm
- An improved Perry conjugate gradient method with adaptive parameter choice
- Modification of nonlinear conjugate gradient method with weak Wolfe-Powell line search
- A novel fractional Tikhonov regularization coupled with an improved super-memory gradient method and application to dynamic force identification problems
- Sufficient descent conjugate gradient methods for solving convex constrained nonlinear monotone equations
- An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization
- Planar methods and grossone for the conjugate gradient breakdown in nonlinear programming
- An efficient modified AZPRP conjugate gradient method for large-scale unconstrained optimization problem
- New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization
- A convexity enforcing C^0 interior penalty method for the Monge-Ampère equation on convex polygonal domains
- Truncated trust region method for nonlinear inverse problems and application in full-waveform inversion
- A three-term conjugate gradient method with accelerated subspace quadratic optimization
- Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems
- Two efficient modifications of AZPRP conjugate gradient method with sufficient descent property
- An active set trust-region method for bound-constrained optimization
- Further comment on another hybrid conjugate gradient algorithm for unconstrained optimization by Andrei
- A globally convergent hybrid conjugate gradient method with strong Wolfe conditions for unconstrained optimization
- New conjugate gradient algorithms based on self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method
- A new subspace minimization conjugate gradient method based on modified secant equation for unconstrained optimization
- An improved Polak-Ribière-Polyak conjugate gradient method with an efficient restart direction
- A novel method of dynamic force identification and its application
- An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization
- A subspace minimization conjugate gradient method based on conic model for unconstrained optimization
- On the connection between the conjugate gradient method and quasi-Newton methods on quadratic problems
- A modified Perry conjugate gradient method and its global convergence
- An optimal subgradient algorithm for large-scale bound-constrained convex optimization
- A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization
- Preconditioned nonlinear conjugate gradient methods based on a modified secant equation
- A nonmonotone approximate sequence algorithm for unconstrained nonlinear optimization
- A conjugate directions approach to improve the limited-memory BFGS method
- A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization
- A scaled conjugate gradient method with moving asymptotes for unconstrained optimization problems
- A decent three term conjugate gradient method with global convergence properties for large scale unconstrained optimization problems
- scientific article; zbMATH DE number 992797 (Why is no real title available?)
- On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients
- Comparison of advanced large-scale minimization algorithms for the solution of inverse ill-posed problems
- Symmetric Perry conjugate gradient method
- An efficient adaptive three-term extension of the Hestenes-Stiefel conjugate gradient method
- A New Dai-Liao Conjugate Gradient Method with Optimal Parameter Choice
- Higher order curvature information and its application in a modified diagonal Secant method
- scientific article; zbMATH DE number 3994938 (Why is no real title available?)
- scientific article; zbMATH DE number 7313238 (Why is no real title available?)
- A new subspace minimization conjugate gradient method based on tensor model for unconstrained optimization
- Inexact Newton-type methods based on Lanczos orthonormal method and application for full waveform inversion
- Add-in for solvers of unconstrained minimization to eliminate lower bounds of variables by transformation
- A limited memory descent Perry conjugate gradient method
- Novel preconditioners based on quasi-Newton updates for nonlinear conjugate gradient methods
- scientific article; zbMATH DE number 6176035 (Why is no real title available?)
- A one-parameter class of three-term conjugate gradient methods with an adaptive parameter choice
- Alternating cyclic vector extrapolation technique for accelerating nonlinear optimization algorithms and fixed-point mapping applications
- A regularized limited memory subspace minimization conjugate gradient method for unconstrained optimization
- A robust BFGS algorithm for unconstrained nonlinear optimization problems
- An overview of nonlinear optimization
- An adaptive nonlinear least-squares finite element method for a Pucci equation in two dimensions
- Algorithm 1035: a gradient-based implementation of the polyhedral active set algorithm
- A three-term conjugate gradient descent method with some applications
- A nonlinear least-squares convexity enforcing C^0 interior penalty method for the Monge-Ampère equation on strictly convex smooth planar domains
- A family of limited memory three term conjugate gradient methods
- CGRS -- an advanced hybrid method for global optimization of continuous functions closely coupling extended random search and conjugate gradient method
- On exact linesearch quasi-Newton methods for minimizing a quadratic function
- Global convergence of an augmented Lagrangian method for nonlinear programming via Riemannian optimization
- Exploiting damped techniques for nonlinear conjugate gradient methods
- A globally convergent gradient method with momentum
- A class of new subspace minimization conjugate gradient algorithms for unconstrained optimization
- Speeding up line search for composite objective function with a linear inside part
- Modified parameter of the Dai-Liao conjugacy condition of the conjugate gradient method with some applications
- A limited memory subspace minimization conjugate gradient algorithm for unconstrained optimization
- A limited memory steepest descent method
- Mini-batch stochastic conjugate gradient algorithms with minimal variance
- Modified four-term conjugate gradient method with applications in image restoration and regression problem
- A globally and quadratically convergent algorithm with efficient implementation for unconstrained optimization
This page was built for publication: The Limited Memory Conjugate Gradient Method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408214)
