A gradient method exploiting the two dimensional quadratic termination property
From MaRDI portal
Publication:6110631
DOI10.1007/s11590-022-01936-zzbMath1527.90260arXiv2208.03501OpenAlexW4296641737MaRDI QIDQ6110631
Publication date: 6 July 2023
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.03501
Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Methods of quasi-Newton type (90C53)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient gradient method using the Yuan steplength
- On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method
- Gradient methods with adaptive step-sizes
- New adaptive stepsize selections in gradient methods
- On the behavior of the gradient norm in the steepest descent method
- Quadratic regularization projected Barzilai-Borwein method for nonnegative matrix factorization
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Analysis of monotone gradient methods
- On the asymptotic convergence and acceleration of gradient methods
- On \(R\)-linear convergence analysis for a class of gradient methods
- On the acceleration of the Barzilai-Borwein method
- Fast gradient methods with alignment for symmetric linear systems without using Cauchy step
- New stepsizes for the gradient method
- A family of spectral gradient methods for optimization
- Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization
- On the steplength selection in gradient methods for unconstrained optimization
- A new gradient method with an optimal stepsize property
- On the asymptotic directions of the s-dimensional optimum gradient method
- R-linear convergence of the Barzilai and Borwein gradient method
- Feasible Barzilai–Borwein-like methods for extreme symmetric eigenvalue problems
- The university of Florida sparse matrix collection
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
- Inexact and Preconditioned Uzawa Algorithms for Saddle Point Problems
- Alternate minimization gradient method
- Inexact spectral projected gradient methods on convex sets
- Alternate step gradient method*
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- A Nonmonotone Line Search Technique for Newton’s Method
- Equipping the Barzilai--Borwein Method with the Two Dimensional Quadratic Termination Property
- Spectral Properties of Barzilai--Borwein Rules in Solving Singly Linearly Constrained Optimization Problems Subject to Lower and Upper Bounds
- Gradient methods exploiting spectral properties
- On the Barzilai and Borwein choice of steplength for the gradient method
- The cyclic Barzilai-–Borwein method for unconstrained optimization
This page was built for publication: A gradient method exploiting the two dimensional quadratic termination property