A gradient method exploiting the two dimensional quadratic termination property
From MaRDI portal
Abstract: The quadratic termination property is important to the efficiency of gradient methods. We consider equipping a family of gradient methods, where the stepsize is given by the ratio of two norms, with two dimensional quadratic termination. Such a desired property is achieved by cooperating with a new stepsize which is derived by maximizing the stepsize of the considered family in the next iteration. It is proved that each method in the family will asymptotically alternate in a two dimensional subspace spanned by the eigenvectors corresponding to the largest and smallest eigenvalues. Based on this asymptotic behavior, we show that the new stepsize converges to the reciprocal of the largest eigenvalue of the Hessian. Furthermore, by adaptively taking the long Barzilai--Borwein stepsize and reusing the new stepsize with retard, we propose an efficient gradient method for unconstrained quadratic optimization. We prove that the new method is -linearly convergent with a rate of , where is the condition number of Hessian. Numerical experiments show the efficiency of our proposed method.
Recommendations
- A gradient-like method for quasidifferentiable optimization
- scientific article; zbMATH DE number 2166157
- Quadratic regularization methods with finite-difference gradient approximations
- Equipping the Barzilai-Borwein method with the two dimensional quadratic termination property
- A two-phase gradient method for quadratic programming problems with a single linear constraint and bounds on the variables
- Gradient algorithms for quadratic optimization with fast convergence rates
- scientific article; zbMATH DE number 4068176
- scientific article; zbMATH DE number 3932308
- scientific article; zbMATH DE number 3936384
- Two-Point Step Size Gradient Methods
Cites work
- scientific article; zbMATH DE number 2221955 (Why is no real title available?)
- A Nonmonotone Line Search Technique for Newton’s Method
- A family of spectral gradient methods for optimization
- A new gradient method with an optimal stepsize property
- A new stepsize for the steepest descent method
- Alternate minimization gradient method
- Alternate step gradient method*
- An efficient gradient method using the Yuan steplength
- Analysis of monotone gradient methods
- Equipping the Barzilai-Borwein method with the two dimensional quadratic termination property
- Fast gradient methods with alignment for symmetric linear systems without using Cauchy step
- Feasible Barzilai-Borwein-like methods for extreme symmetric eigenvalue problems
- Gradient methods exploiting spectral properties
- Gradient methods with adaptive step-sizes
- Inexact and Preconditioned Uzawa Algorithms for Saddle Point Problems
- Inexact spectral projected gradient methods on convex sets
- New adaptive stepsize selections in gradient methods
- New stepsizes for the gradient method
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- On \(R\)-linear convergence analysis for a class of gradient methods
- On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method
- On the Barzilai and Borwein choice of steplength for the gradient method
- On the acceleration of the Barzilai-Borwein method
- On the asymptotic convergence and acceleration of gradient methods
- 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 steplength selection in gradient methods for unconstrained optimization
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Quadratic regularization projected Barzilai-Borwein method for nonnegative matrix factorization
- Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization
- Spectral properties of Barzilai-Borwein rules in solving singly linearly constrained optimization problems subject to lower and upper bounds
- Step-sizes for the gradient method
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- The University of Florida sparse matrix collection
- The cyclic Barzilai-–Borwein method for unconstrained optimization
- Two-Point Step Size Gradient Methods
- R-linear convergence of the Barzilai and Borwein gradient method
This page was built for publication: A gradient method exploiting the two dimensional quadratic termination property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6110631)
