Gradient methods exploiting spectral properties
From MaRDI portal
Publication:5135250
DOI10.1080/10556788.2020.1727476zbMath1454.90042arXiv1905.03870OpenAlexW3008369138MaRDI QIDQ5135250
Yakui Huang, Hongchao Zhang, Yu-Hong Dai, Xin-Wei Liu
Publication date: 19 November 2020
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.03870
gradient methodsquadratic optimizationlinear convergencespectral propertybound constrained optimizationBarizilai-Borwein method
Related Items (11)
On initial point selection of the steepest descent algorithm for general quadratic functions ⋮ Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems ⋮ A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization ⋮ A gradient method exploiting the two dimensional quadratic termination property ⋮ On the Preconditioned Delayed Weighted Gradient Method ⋮ Properties of the delayed weighted gradient method ⋮ On the asymptotic convergence and acceleration of gradient methods ⋮ Level set of the asymptotic rate of convergence for the method of steepest descent ⋮ Variable metric proximal stochastic variance reduced gradient methods for nonconvex nonsmooth optimization ⋮ Equipping the Barzilai--Borwein Method with the Two Dimensional Quadratic Termination Property ⋮ On the acceleration of the Barzilai-Borwein method
Uses Software
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
- Support-vector networks
- A family of spectral gradient methods for optimization
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical 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 Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- A New Active Set Algorithm for Box Constrained Optimization
- A Positive Barzilai–Borwein-Like Stepsize and an Extension for Symmetric Linear Systems
- Two-Point Step Size Gradient Methods
- Gradient Method with Retards and Generalizations
- Inexact and Preconditioned Uzawa Algorithms for Saddle Point Problems
- Alternate minimization gradient method
- Alternate step gradient method*
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Coordinated Beamforming for MISO Interference Channel: Complexity Analysis and Efficient Algorithms
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- On the Barzilai and Borwein choice of steplength for the gradient method
- Learning the parts of objects by non-negative matrix factorization
- Benchmarking optimization software with performance profiles.
- Adaptive two-point stepsize gradient algorithm
- On the steepest descent algorithm for quadratic functions
This page was built for publication: Gradient methods exploiting spectral properties
