Gradient Method with Retards and Generalizations
From MaRDI portal
Publication:4243561
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)
convergencepreconditioningconjugate gradient methodRayleigh quotientgradient methodBarzilai-Borwein methodsymmetric successive overrelaxationsteepest descent method
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Iterative numerical methods for linear systems (65F10)
Related Items
On the regularizing behavior of the SDA and SDC gradient methods in the solution of linear ill-posed problems, Algorithms that satisfy a stopping criterion, probably, Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules, Hybrid spectral gradient method for the unconstrained minimization problem, On the rate of convergence of projected Barzilai–Borwein methods, Partial spectral projected gradient method with active-set strategy for linearly constrained optimization, Gradient methods with adaptive step-sizes, A new adaptive Barzilai and Borwein method for unconstrained optimization, Projected gradient algorithms for optimization over order simplices, Gradient projection methods for quadratic programs and applications in training support vector machines, Steepest descent method with random step lengths, Synchrotron radiation-based \(l_1\)-norm regularization on micro-CT imaging in shale structure analysis, Cooperative concurrent asynchronous computation of the solution of symmetric linear systems, 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 steplength selection in gradient methods for unconstrained optimization, A dynamical Tikhonov regularization for solving ill-posed linear algebraic systems, Alternating cyclic vector extrapolation technique for accelerating nonlinear optimization algorithms and fixed-point mapping applications, Spectral Properties of Barzilai--Borwein Rules in Solving Singly Linearly Constrained Optimization Problems Subject to Lower and Upper Bounds, Fast gradient methods with alignment for symmetric linear systems without using Cauchy step, On the Preconditioned Delayed Weighted Gradient Method, Linear convergence analysis of the use of gradient projection methods on total variation problems, A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand, Smooth and adaptive gradient method with retards, Secant Acceleration of Sequential Residual Methods for Solving Large-Scale Nonlinear Systems of Equations, A harmonic framework for stepsize selection in gradient methods, Iterative regularization algorithms for constrained image deblurring on graphics processors, Geometric interpretation of some Cauchy related methods, The chaotic nature of faster gradient descent methods, Gradient methods exploiting spectral properties, Variable metric techniques for forward-backward methods in imaging, A numerical study of applying spectral-step subgradient method for solving nonsmooth unconstrained optimization problems, An efficient gradient method using the Yuan steplength, New stepsizes for the gradient method, An efficient gradient method with approximate optimal stepsize for the strictly convex quadratic minimization problem, A second-order gradient method for convex minimization, A NONMONOTONE FILTER BARZILAI-BORWEIN METHOD FOR OPTIMIZATION, Error minimizing relaxation strategies in Landweber and Kaczmarz type iterations, A new modified Barzilai-Borwein gradient method for the quadratic minimization problem, Stochastic gradient descent with Barzilai-Borwein update step for SVM, An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization, On the asymptotic behaviour of some new gradient methods, Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming, 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 limited memory steepest descent method, Notes on the Dai-Yuan-Yuan modified spectral gradient method, Gradient descent and fast artificial time integration, Properties of the delayed weighted gradient method, A new gradient method with an optimal stepsize property, A delayed weighted gradient method for strictly convex quadratic minimization, Faster gradient descent and the efficient recovery of images, Accelerated gradient descent methods with line search, 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, An affine-scaling interior-point CBB method for box-constrained optimization, Alternate step gradient method*, On the inexact scaled gradient projection method, On \(R\)-linear convergence analysis for a class of gradient methods, A family of spectral gradient methods for optimization, A descent algorithm without line search for unconstrained optimization, New iterative schemes for nonlinear fixed point problems, with applications to problems with bifurcations and incomplete-data problems, Equipping the Barzilai--Borwein Method with the Two Dimensional Quadratic Termination Property, A flexible inexact-restoration method for constrained optimization, An optimal tri-vector iterative algorithm for solving ill-posed linear inverse problems, Hybrid limited memory gradient projection methods for box-constrained optimization problems, On the acceleration of the Barzilai-Borwein method, Diagonal BFGS updates and applications to the limited memory BFGS method
