On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches

DOI10.1007/S11565-022-00437-2zbMATH Open1500.65023OpenAlexW4293094494MaRDI QIDQ2084591FDOQ2084591

Luca Zanni, V. Ruggiero, Serena Crisci, F. Porta

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

zbMATH Keywords

constrained optimizationvariable metricscaled gradient projection methodsnon-monotone line searches

Mathematics Subject Classification ID

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Rapidly Convergent Descent Method for Minimization
• Benchmarking optimization software with performance profiles.
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• Two-Point Step Size Gradient Methods
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• A scaled gradient projection method for constrained image deblurring
• Projected gradient methods for linearly constrained problems
• A Nonmonotone Line Search Technique for Newton’s Method
• Constrained global optimization: algorithms and applications
• On the worst-case evaluation complexity of non-monotone line search algorithms
• On the Identification Property of a Projected Gradient Method
• On the Identification of Active Constraints
• Variable metric quasi-Fejér monotonicity
• Convergence properties of projection and contraction methods for variational inequality problems
• On the Goldstein-Levitin-Polyak gradient projection method
• Scalable algorithms for contact problems
• Convergence of the gradient projection method for generalized convex minimization
• Penalized maximum likelihood image restoration with positivity constraints: multiplicative algorithms
• On the convergence of projected gradient processes to singular critical points
• On the convergence properties of the projected gradient method for convex optimization
• Generating box-constrained optimization problems
• Convergence properties of nonmonotone spectral projected gradient methods
• A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables
• New convergence results for the scaled gradient projection method
• Steplength selection in gradient projection methods for box-constrained quadratic programs
• Variable metric techniques for forward-backward methods in imaging
• On the inexact scaled gradient projection method
• Spectral Properties of Barzilai--Borwein Rules in Solving Singly Linearly Constrained Optimization Problems Subject to Lower and Upper Bounds

Cited In (3)

• Hybrid limited memory gradient projection methods for box-constrained optimization problems
• Barzilai–Borwein-like rules in proximal gradient schemes for ℓ ₁ -regularized problems
• On the stationarity for nonlinear optimization problems with polyhedral constraints

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)