Gradient Method with Retards and Generalizations

DOI10.1137/S003614299427315XzbMath0940.65032MaRDI QIDQ4243561

Marcos Raydan, Brígida Molina, Ana Friedlander, José Mario Martínez

Publication date: 19 May 1999

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

zbMATH Keywords

convergence; preconditioning; conjugate gradient method; Rayleigh quotient; gradient method; Barzilai-Borwein method; symmetric successive overrelaxation; steepest descent method

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C20: Quadratic programming

65F10: Iterative numerical methods for linear systems

Related Items

Alternate step gradient method*, Gradient descent and fast artificial time integration, Gradient projection methods for quadratic programs and applications in training support vector machines, Accelerated gradient descent methods with line search, A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand, The chaotic nature of faster gradient descent methods, An efficient gradient method using the Yuan steplength, Geometric interpretation of some Cauchy related methods, A limited memory steepest descent method, Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules, Hybrid spectral gradient method for the unconstrained minimization problem, Partial spectral projected gradient method with active-set strategy for linearly constrained optimization, Gradient methods with adaptive step-sizes, Notes on the Dai-Yuan-Yuan modified spectral gradient method, An affine-scaling interior-point CBB method for box-constrained optimization, A descent algorithm without line search for unconstrained optimization, Smooth and adaptive gradient method with retards, Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming, A dynamical Tikhonov regularization for solving ill-posed linear algebraic systems, Linear convergence analysis of the use of gradient projection methods on total variation problems, Iterative regularization algorithms for constrained image deblurring on graphics processors, A flexible inexact-restoration method for constrained optimization, On the asymptotic behaviour of some new gradient methods, New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds, On memory gradient method with trust region for unconstrained optimization, 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, An alternating direction method for solving a class of inverse semi-definite quadratic programming problems, New iterative schemes for nonlinear fixed point problems, with applications to problems with bifurcations and incomplete-data problems, An optimal tri-vector iterative algorithm for solving ill-posed linear inverse problems, Projected gradient algorithms for optimization over order simplices, On the rate of convergence of projected Barzilai–Borwein methods, A NONMONOTONE FILTER BARZILAI-BORWEIN METHOD FOR OPTIMIZATION