A new modified Barzilai-Borwein gradient method for the quadratic minimization problem
From MaRDI portal
Publication:511967
DOI10.1007/s10957-016-1008-9zbMath1358.65039OpenAlexW2522336029MaRDI QIDQ511967
Publication date: 23 February 2017
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-016-1008-9
global convergencenumerical experimentsmulti-step methodBarzilai-Borwein gradient methodconvex quadratic minimization problem
Numerical mathematical programming methods (65K05) Convex programming (90C25) Quadratic programming (90C20) Methods of reduced gradient type (90C52)
Related Items (7)
Analysis of the Barzilai-Borwein step-sizes for problems in Hilbert spaces ⋮ Effective zero-norm minimization algorithms for noisy compressed sensing ⋮ New stepsizes for the gradient method ⋮ An efficient gradient method with approximate optimal stepsize for the strictly convex quadratic minimization problem ⋮ An efficient nonmonotone adaptive cubic regularization method with line search for unconstrained optimization problem ⋮ On DC based methods for phase retrieval ⋮ Accelerated augmented Lagrangian method for total variation minimization
Cites Work
- Unnamed Item
- Multi-step quasi-Newton methods for optimization
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- R-linear convergence of the Barzilai and Borwein gradient method
- On spectral properties of steepest descent methods
- Two-Point Step Size Gradient Methods
- Gradient Method with Retards and Generalizations
- Alternate minimization gradient method
- Alternate step gradient method*
- On the Barzilai and Borwein choice of steplength for the gradient method
- Relaxed steepest descent and Cauchy-Barzilai-Borwein method
- On the steepest descent algorithm for quadratic functions
This page was built for publication: A new modified Barzilai-Borwein gradient method for the quadratic minimization problem
