On the steepest descent algorithm for quadratic functions
From MaRDI portal
Publication:5963682
DOI10.1007/s10589-015-9775-zzbMath1360.90183OpenAlexW2204799877MaRDI QIDQ5963682
Ruana M. Schneider, Clóvis C. Gonzaga
Publication date: 23 February 2016
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-015-9775-z
Related Items
On initial point selection of the steepest descent algorithm for general quadratic functions, A new descent algorithm using the three-step discretization method for solving unconstrained optimization problems, On the worst case performance of the steepest descent algorithm for quadratic functions, Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems, A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization, Gradient method with multiple damping for large-scale unconstrained optimization, On the Forsythe conjecture, On the steplength selection in gradient methods for unconstrained optimization, Fast gradient method for low-rank matrix estimation, Fast gradient methods with alignment for symmetric linear systems without using Cauchy step, Gradient methods exploiting spectral properties, New stepsizes for the gradient method, A cyclic block coordinate descent method with generalized gradient projections, A new modified Barzilai-Borwein gradient method for the quadratic minimization problem, A coordinate descent method for total variation minimization, Steplength selection in gradient projection methods for box-constrained quadratic programs, Reconstruction of 3D X-ray CT images from reduced sampling by a scaled gradient projection algorithm, On the asymptotic convergence and acceleration of gradient methods, A family of spectral gradient methods for optimization, On the acceleration of the Barzilai-Borwein method
Cites Work
- An efficient gradient method using the Yuan steplength
- On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method
- On the behavior of the gradient norm in the steepest descent method
- On the asymptotic directions of the s-dimensional optimum gradient method
- On spectral properties of steepest descent methods
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
- Alternate step gradient method*
- Benchmarking optimization software with performance profiles.
- Relaxed steepest descent and Cauchy-Barzilai-Borwein method
