On the behavior of the gradient norm in the steepest descent method
From MaRDI portal
Publication:1610310
DOI10.1023/A:1014897230089zbMath1008.90057OpenAlexW1547688086MaRDI QIDQ1610310
Annick Sartenaer, Ciyou Zhu, Nocedal, Jorge
Publication date: 19 August 2002
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1014897230089
Related Items
On the regularizing behavior of the SDA and SDC gradient methods in the solution of linear ill-posed problems, On initial point selection of the steepest descent algorithm for general quadratic functions, 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, On the Forsythe conjecture, On the steplength selection in gradient methods for unconstrained optimization, A gradient method exploiting the two dimensional quadratic termination property, Fast gradient methods with alignment for symmetric linear systems without using Cauchy step, The chaotic nature of faster gradient descent methods, A new analysis on the Barzilai-Borwein gradient method, Gradient methods exploiting spectral properties, An efficient gradient method using the Yuan steplength, New stepsizes for the gradient method, On the asymptotic behaviour of some new gradient methods, Asymptotic behaviour of a family of gradient algorithms in \(\mathbb R^{ d }\) and Hilbert spaces, Gradient descent and fast artificial time integration, A new gradient method with an optimal stepsize property, Faster gradient descent and the efficient recovery of images, A globally optimal tri-vector method to solve an ill-posed linear system, On the steepest descent algorithm for quadratic functions, On the asymptotic convergence and acceleration of gradient methods, A new trust region method with adaptive radius, Alternate step gradient method*, A family of spectral gradient methods for optimization, An optimal tri-vector iterative algorithm for solving ill-posed linear inverse problems
Uses Software
