On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches
From MaRDI portal
Publication:2084591
Recommendations
- On the convergence rate of scaled gradient projection method
- On the inexact scaled gradient projection method
- New convergence results for the scaled gradient projection method
- On the convergence properties of the projected gradient method for convex optimization
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 4164577 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 2221955 (Why is no real title available?)
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- A Rapidly Convergent Descent Method for Minimization
- A scaled gradient projection method for constrained image deblurring
- A two-phase gradient method for quadratic programming problems with a single linear constraint and bounds on the variables
- Benchmarking optimization software with performance profiles.
- Constrained global optimization: algorithms and applications
- Convergence of the gradient projection method for generalized convex minimization
- Convergence properties of nonmonotone spectral projected gradient methods
- Convergence properties of projection and contraction methods for variational inequality problems
- Generating box-constrained optimization problems
- New convergence results for the scaled gradient projection method
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- On the Goldstein-Levitin-Polyak gradient projection method
- On the Identification Property of a Projected Gradient Method
- On the Identification of Active Constraints
- On the convergence of projected gradient processes to singular critical points
- On the convergence properties of the projected gradient method for convex optimization
- On the inexact scaled gradient projection method
- On the worst-case evaluation complexity of non-monotone line search algorithms
- Penalized maximum likelihood image restoration with positivity constraints: multiplicative algorithms
- Projected gradient methods for linearly constrained problems
- Scalable algorithms for contact problems
- Spectral properties of Barzilai-Borwein rules in solving singly linearly constrained optimization problems subject to lower and upper bounds
- Steplength selection in gradient projection methods for box-constrained quadratic programs
- Two-Point Step Size Gradient Methods
- Variable metric quasi-Fejér monotonicity
- Variable metric techniques for forward-backward methods in imaging
Cited in
(4)- On the stationarity for nonlinear optimization problems with polyhedral constraints
- Hybrid limited memory gradient projection methods for box-constrained optimization problems
- On the convergence rate of scaled gradient projection method
- Barzilai–Borwein-like rules in proximal gradient schemes for ℓ 1 -regularized problems
This page was built for publication: On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2084591)
