Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
From MaRDI portal
Publication:5436920
DOI10.1080/10556780600822260zbMath1270.90068OpenAlexW2136780394MaRDI QIDQ5436920
Publication date: 18 January 2008
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780600822260
unconstrained optimizationconjugate gradient methodWolfe line searchspectral gradient methodBFGS preconditioning
Related Items (36)
Some new three-term Hestenes–Stiefel conjugate gradient methods with affine combination ⋮ A descent hybrid conjugate gradient method based on the memoryless BFGS update ⋮ A modified scaling parameter for the memoryless BFGS updating formula ⋮ On the Barzilai–Borwein gradient methods with structured secant equation for nonlinear least squares problems ⋮ Accelerated conjugate gradient algorithm with finite difference Hessian/vector product approximation for unconstrained optimization ⋮ Another conjugate gradient algorithm with guaranteed descent and conjugacy conditions for large-scale unconstrained optimization ⋮ Two modified scaled nonlinear conjugate gradient methods ⋮ On optimality of the parameters of self-scaling memoryless quasi-Newton updating formulae ⋮ Spectral conjugate gradient methods for vector optimization problems ⋮ Preconditioned nonlinear conjugate gradient methods based on a modified secant equation ⋮ A restart scheme for the memoryless BFGS method ⋮ Global convergence of a modified Fletcher–Reeves conjugate gradient method with Wolfe line search ⋮ A descent extension of a modified Polak-Ribière-Polyak method with application in image restoration problem ⋮ On the sufficient descent property of the Shanno's conjugate gradient method ⋮ A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization ⋮ Unnamed Item ⋮ A note on the global convergence theorem of the scaled conjugate gradient algorithms proposed by Andrei ⋮ A new modified scaled conjugate gradient method for large-scale unconstrained optimization with non-convex objective function ⋮ Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization ⋮ A Dai-Yuan conjugate gradient algorithm with sufficient descent and conjugacy conditions for unconstrained optimization ⋮ A derivative-free conjugate gradient method and its global convergence for solving symmetric nonlinear equations ⋮ Novel preconditioners based on quasi-Newton updates for nonlinear conjugate gradient methods ⋮ Another hybrid conjugate gradient algorithm for unconstrained optimization ⋮ A descent spectral conjugate gradient method for impulse noise removal ⋮ Erratum to: Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization ⋮ Two--parameter scaled memoryless BFGS methods with a nonmonotone choice for the initial step length ⋮ Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization ⋮ On three-term conjugate gradient algorithms for unconstrained optimization ⋮ A new three-term conjugate gradient algorithm for unconstrained optimization ⋮ An accelerated conjugate gradient algorithm with guaranteed descent and conjugacy conditions for unconstrained optimization ⋮ Hybrid conjugate gradient algorithm for unconstrained optimization ⋮ Acceleration of conjugate gradient algorithms for unconstrained optimization ⋮ Scaled nonlinear conjugate gradient methods for nonlinear least squares problems ⋮ A modified Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization ⋮ A new spectral conjugate gradient method for large-scale unconstrained optimization ⋮ A modified Perry conjugate gradient method and its global convergence
Uses Software
Cites Work
- Convergence properties of the Beale-Powell restart algorithm
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Algorithm 851
- Self-Scaling Variable Metric (SSVM) Algorithms
- Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]
- Optimal conditioning of self-scaling variable Metric algorithms
- Some convergence properties of the conjugate gradient method
- Restart procedures for the conjugate gradient method
- Conjugate Gradient Methods with Inexact Searches
- On the Convergence of a New Conjugate Gradient Algorithm
- CUTE
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Function minimization by conjugate gradients
- Convergence Conditions for Ascent Methods
- Convergence Conditions for Ascent Methods. II: Some Corrections
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- A spectral conjugate gradient method for unconstrained optimization
This page was built for publication: Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
