On the rate of convergence of projected Barzilai–Borwein methods
From MaRDI portal
Publication:3458822
DOI10.1080/10556788.2015.1004064zbMath1338.90300OpenAlexW2047006220MaRDI QIDQ3458822
Publication date: 28 December 2015
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2015.1004064
\(R\)-linear convergencenon-monotone line searchconvex constrained optimizationprojected Barzilai-Borwein method
Related Items (7)
Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization ⋮ An extended projected residual algorithm for solving smooth convex optimization problems ⋮ On the convergence rate of scaled gradient projection method ⋮ Proximal quasi-Newton method for composite optimization over the Stiefel manifold ⋮ Accelerated method for optimization over density matrices in quantum state estimation ⋮ Steplength selection in gradient projection methods for box-constrained quadratic programs ⋮ Equipping the Barzilai--Borwein Method with the Two Dimensional Quadratic Termination Property
Cites Work
- Unnamed Item
- A new analysis on the Barzilai-Borwein gradient method
- A Barzilai-Borwein type method for stochastic linear complementarity problems
- A Barzilai-Borwein type method for minimizing composite functions
- New adaptive stepsize selections in gradient methods
- Greatest descent algorithms in unconstrained optimization
- The gradient projection method with exact line search
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- On the convergence of projected gradient processes to singular critical points
- On the asymptotic behaviour of some new gradient methods
- R-linear convergence of the Barzilai and Borwein gradient method
- On spectral properties of steepest descent methods
- Gradient-Based Methods for Sparse Recovery
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Metric Projection Methods for Constrained Optimization
- A New Active Set Algorithm for Box Constrained Optimization
- A scaled gradient projection method for constrained image deblurring
- Projected gradient methods for linearly constrained problems
- Two-Point Step Size Gradient Methods
- Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- On the Rate of Convergence of a Partially Asynchronous Gradient Projection Algorithm
- On the Goldstein-Levitin-Polyak gradient projection method
- Gradient Method with Retards and Generalizations
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Sparse Reconstruction by Separable Approximation
- 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
- The cyclic Barzilai-–Borwein method for unconstrained optimization
- Convex programming in Hilbert space
- Adaptive two-point stepsize gradient algorithm
- On the nonmonotone line search
This page was built for publication: On the rate of convergence of projected Barzilai–Borwein methods
