Convergence analysis for the modified spectral projected subgradient method

DOI10.1007/s11590-014-0792-0zbMath1351.90151OpenAlexW2048629387MaRDI QIDQ2355316

Alejandro Crema, Milagros C. Loreto

Publication date: 22 July 2015

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-014-0792-0

zbMATH Keywords

global convergencesubgradient optimizationspectral projected gradient

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Related Items (4)

Modified spectral projected subgradient method: convergence analysis and momentum parameter heuristics ⋮ Nonsmooth spectral gradient methods for unconstrained optimization ⋮ A subgradient method with non-monotone line search ⋮ A numerical study of applying spectral-step subgradient method for solving nonsmooth unconstrained optimization problems

Uses Software

• SPG
• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectral projected subgradient with a momentum term for the Lagrangean dual approach
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• Two-Point Step Size Gradient Methods
• On the Goldstein-Levitin-Polyak gradient projection method
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• A Nonmonotone Line Search Technique for Newton’s Method
• Validation of subgradient optimization
• A Heuristic Method for the Set Covering Problem
• On the Barzilai and Borwein choice of steplength for the gradient method
• Algorithm 813
• Computing the Ehrhart quasi-polynomial of a rational simplex
• Convex programming in Hilbert space

This page was built for publication: Convergence analysis for the modified spectral projected subgradient method