On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches
From MaRDI portal
Publication:2084591
DOI10.1007/s11565-022-00437-2zbMath1500.65023OpenAlexW4293094494MaRDI QIDQ2084591
Serena Crisci, Federica Porta, Luca Zanni, Valeria Ruggiero
Publication date: 18 October 2022
Published in: Annali dell'Università di Ferrara. Sezione VII. Scienze Matematiche (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11565-022-00437-2
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
On the stationarity for nonlinear optimization problems with polyhedral constraints, Hybrid limited memory gradient projection methods for box-constrained optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scalable algorithms for contact problems
- On the convergence properties of the projected gradient method for convex optimization
- Convergence properties of nonmonotone spectral projected gradient methods
- Variable metric quasi-Fejér monotonicity
- Constrained global optimization: algorithms and applications
- Convergence of the gradient projection method for generalized convex minimization
- On the worst-case evaluation complexity of non-monotone line search algorithms
- On the convergence of projected gradient processes to singular critical points
- Steplength selection in gradient projection methods for box-constrained quadratic programs
- On the inexact scaled gradient projection method
- Variable metric techniques for forward-backward methods in imaging
- On the Identification Property of a Projected Gradient Method
- New convergence results for the scaled gradient projection method
- A scaled gradient projection method for constrained image deblurring
- Projected gradient methods for linearly constrained problems
- Two-Point Step Size Gradient Methods
- On the Identification of Active Constraints
- Generating box-constrained optimization problems
- On the Goldstein-Levitin-Polyak gradient projection method
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables
- A Nonmonotone Line Search Technique for Newton’s Method
- Penalized maximum likelihood image restoration with positivity constraints: multiplicative algorithms
- Spectral Properties of Barzilai--Borwein Rules in Solving Singly Linearly Constrained Optimization Problems Subject to Lower and Upper Bounds
- A Rapidly Convergent Descent Method for Minimization
- Convergence properties of projection and contraction methods for variational inequality problems
- Benchmarking optimization software with performance profiles.
