A speed up strategy for gradient methods

Cites work

A Dynamical-System Analysis of the Optimum s-Gradient Algorithm
A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization
A harmonic framework for stepsize selection in gradient methods
A limited memory steepest descent method
A New Algorithm for Unconstrained Optimization
A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
A Nonmonotone Line Search Technique for Newton’s Method
A Nonnegatively Constrained Convex Programming Method for Image Reconstruction
A note on performance profiles for benchmarking software
A scaled gradient projection method for constrained image deblurring
A two-dimensional search used with a nonlinear least-squares solver
A two-phase gradient method for quadratic programming problems with a single linear constraint and bounds on the variables
Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules
An extended delayed weighted gradient algorithm for solving strongly convex optimization problems
An unconstrained optimization test functions collection
Barzilai–Borwein-like rules in proximal gradient schemes for ℓ ₁ -regularized problems
Benchmarking optimization software with performance profiles.
Convergence Conditions for Ascent Methods
Delayed weighted gradient method with simultaneous step-sizes for strongly convex optimization
Duality-based algorithms for total-variation-regularized image restoration
Gradient Method with Retards and Generalizations
Gradient methods with adaptive step-sizes
Gradient projection methods for quadratic programs and applications in training support vector machines
scientific article; zbMATH DE number 1818892 (Why is no real title available?)
scientific article; zbMATH DE number 2221955 (Why is no real title available?)
scientific article; zbMATH DE number 3057625 (Why is no real title available?)
Inexact spectral projected gradient methods on convex sets
New adaptive stepsize selections in gradient methods
New convergence results for the scaled gradient projection method
Nonmonotone Spectral Projected Gradient Methods on Convex Sets
On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method
On the application of the spectral projected gradient method in image segmentation
On the asymptotic directions of the s-dimensional optimum gradient method
On the behavior of the gradient norm in the steepest descent method
On the Identification Property of a Projected Gradient Method
On the nonmonotone line search
On the Solution of Large Quadratic Programming Problems with Bound Constraints
On the stationarity for nonlinear optimization problems with polyhedral constraints
On the steepest descent algorithm for quadratic functions
On the steplength selection in gradient methods for unconstrained optimization
Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
Projected gradient methods for linearly constrained problems
Relaxed steepest descent and Cauchy-Barzilai-Borwein method
s-step iterative methods for symmetric linear systems
Some methods of speeding up the convergence of iteration methods
Sparse Reconstruction by Separable Approximation
Spectral properties of Barzilai-Borwein rules in solving singly linearly constrained optimization problems subject to lower and upper bounds
Steplength selection in gradient projection methods for box-constrained quadratic programs
The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints
Two new unconstrained optimization algorithms which use function and gradient values
Two-Point Step Size Gradient Methods
Using gradient directions to get global convergence of Newton-type methods

This page was built for publication: A speed up strategy for gradient methods

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