On the steepest descent algorithm for quadratic functions

DOI10.1007/S10589-015-9775-ZzbMATH Open1360.90183OpenAlexW2204799877MaRDI QIDQ5963682FDOQ5963682

Authors: C. C. Gonzaga, Ruana M. Schneider

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

Recommendations

On the worst case performance of the steepest descent algorithm for quadratic functions
On spectral properties of steepest descent methods
Two-Point Step Size Gradient Methods
A new stepsize for the steepest descent method
The steepest descent method for the quadratic matrix equation

zbMATH Keywords

Chebyshev polynomial exact line searches short steps

Mathematics Subject Classification ID

Quadratic programming (90C20)

Cites Work

Benchmarking optimization software with performance profiles.
The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
Two-Point Step Size Gradient Methods
On the behavior of the gradient norm in the steepest descent method
On spectral properties of steepest descent methods
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
Relaxed steepest descent and Cauchy-Barzilai-Borwein method
On the asymptotic directions of the s-dimensional optimum gradient method
Alternate step gradient method*

Cited In (26)

A short note on the Q-linear convergence of the steepest descent method
A coordinate descent method for total variation minimization
On the Forsythe conjecture
Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems
On the asymptotic convergence and acceleration of gradient methods
Steplength selection in gradient projection methods for box-constrained quadratic programs
Fast gradient method for low-rank matrix estimation
A cyclic block coordinate descent method with generalized gradient projections
On Steepest Descent Algorithms for Discrete Convex Functions
On initial point selection of the steepest descent algorithm for general quadratic functions
New stepsizes for the gradient method
Some convergence properties of the steepest descent algorithm revealed by renormalisation.
A new descent algorithm using the three-step discretization method for solving unconstrained optimization problems
A new modified Barzilai-Borwein gradient method for the quadratic minimization problem
On the steplength selection in gradient methods for unconstrained optimization
On the acceleration of the Barzilai-Borwein method
Reconstruction of 3D X-ray CT images from reduced sampling by a scaled gradient projection algorithm
On the worst case performance of the steepest descent algorithm for quadratic functions
Gradient method with multiple damping for large-scale unconstrained optimization
Title not available (Why is that?)
A family of spectral gradient methods for optimization
Title not available (Why is that?)
A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization
Fast gradient methods with alignment for symmetric linear systems without using Cauchy step
Barzilai–Borwein-like rules in proximal gradient schemes for ℓ ₁ -regularized problems
Gradient methods exploiting spectral properties

This page was built for publication: On the steepest descent algorithm for quadratic functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963682)