A class of accelerated subspace minimization conjugate gradient methods
From MaRDI portal
Publication:2231338
DOI10.1007/s10957-021-01897-wzbMath1478.90127OpenAlexW3196355701MaRDI QIDQ2231338
Publication date: 29 September 2021
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-021-01897-w
conjugate gradient methodBarzilai-Borwein methodsubspace minimizationregularization modelacceleration method
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)
Related Items (4)
A regularized limited memory subspace minimization conjugate gradient method for unconstrained optimization ⋮ A new subspace minimization conjugate gradient method for unconstrained minimization ⋮ Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems ⋮ A novel improved whale optimization algorithm for optimization problems with multi-strategy and hybrid algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new three-term conjugate gradient algorithm for unconstrained optimization
- A Barzilai-Borwein conjugate gradient method
- An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization
- Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization
- Acceleration of conjugate gradient algorithms for unconstrained optimization
- Modified two-point stepsize gradient methods for unconstrained optimization
- A subspace conjugate gradient algorithm for large-scale unconstrained optimization
- An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization
- An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization
- New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization
- Nonlinear conjugate gradient methods for unconstrained optimization
- Diagonal approximation of the Hessian by finite differences for unconstrained optimization
- A subspace minimization conjugate gradient method based on conic model for unconstrained optimization
- A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization
- An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion
- A Modified BFGS Algorithm for Unconstrained Optimization
- Algorithm 851
- Two-Point Step Size Gradient Methods
- Numerical Optimization
- A Subspace Study on Conjugate Gradient Algorithms
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A new subspace minimization conjugate gradient method based on tensor model for unconstrained optimization
- A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Function minimization by conjugate gradients
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
This page was built for publication: A class of accelerated subspace minimization conjugate gradient methods
