A new stepsize for the steepest descent method

zbMATH Open1101.65067MaRDI QIDQ5488734FDOQ5488734

Publication date: 22 September 2006

Recommendations

A novel of step size selection procedures for steepest descent method
scientific article; zbMATH DE number 2221955
On the Barzilai and Borwein choice of steplength for the gradient method
Two-Point Step Size Gradient Methods
On spectral properties of steepest descent methods

convergence numerical results algorithm unconstrained optimization line search large scale problems stepsize selection

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)

Cited In (47)

Tikhonov regularization for a general nonlinear constrained optimization problem
A new step length in a projection and contraction method
On the regularizing behavior of the SDA and SDC gradient methods in the solution of linear ill-posed problems
The convergence of conjugate gradient method with nonmonotone line search
Steplengths in the extragradient type methods
An efficient gradient method using the Yuan steplength
Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems
On the asymptotic convergence and acceleration of gradient methods
A new steepest descent method with global convergence properties
A new conjugate gradient algorithm with cubic Barzilai–Borwein stepsize for unconstrained optimization
Training GANs with centripetal acceleration
A limited memory steepest descent method
Equipping the Barzilai--Borwein Method with the Two Dimensional Quadratic Termination Property
Cyclic gradient methods for unconstrained optimization
Delayed weighted gradient method with simultaneous step-sizes for strongly convex optimization
A modified steepest descent scheme for solving a class of parameter identification problems
New stepsizes for the gradient method
Accelerated multiple step-size methods for solving unconstrained optimization problems
On the Preconditioned Delayed Weighted Gradient Method
New gradient methods with adaptive stepsizes by approximate models
Analysis of the Barzilai-Borwein step-sizes for problems in Hilbert spaces
A new descent algorithm using the three-step discretization method for solving unconstrained optimization problems
A new adaptive Barzilai and Borwein method for unconstrained optimization
A delayed weighted gradient method for strictly convex quadratic minimization
A new modified Barzilai-Borwein gradient method for the quadratic minimization problem
On the steplength selection in gradient methods for unconstrained optimization
Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
A joint matrix minimization approach for multi-image face recognition
A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables
Two-Point Step Size Gradient Methods
Diagonal BFGS updates and applications to the limited memory BFGS method
On the acceleration of the Barzilai-Borwein method
A new steplength selection for scaled gradient methods with application to image deblurring
An overview of nonlinear optimization
Gravity-magnetic cross-gradient joint inversion by the cyclic gradient method
Overlooked Branch Cut in Steepest Descent Method: Switching Line and Atomic Domain
An efficient gradient method with approximate optimal stepsize for the strictly convex quadratic minimization problem
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
A dynamical Tikhonov regularization for solving ill-posed linear algebraic systems
A gradient method exploiting the two dimensional quadratic termination property
Several kinds of acceleration techniques for unconstrained optimization first-order algorithms
A survey of gradient methods for solving nonlinear optimization
A new search procedure of steepest ascent in response surface exploration
Monotone projected gradient methods for large-scale box-constrained quadratic programming
A new gradient method via quasi-Cauchy relation which guarantees descent
Gradient methods exploiting spectral properties

This page was built for publication: A new stepsize for the steepest descent method

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