A subgradient method with non-monotone line search

DOI10.1007/s10589-022-00438-zOpenAlexW4310488135MaRDI QIDQ2696908

E. M. Santos, Geovani Nunes Grapiglia, Orizon P. Ferreira, João Carlos O. Souza

Publication date: 17 April 2023

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.10009

zbMATH Keywords

subgradient methodconvex functionnon-monotone line search

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Uses Software

• CVX
• Pegasos

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Subgradient methods for huge-scale optimization problems
• Convergence of a simple subgradient level method
• Convergence of some algorithms for convex minimization
• On the worst-case evaluation complexity of non-monotone line search algorithms
• A numerical study of applying spectral-step subgradient method for solving nonsmooth unconstrained optimization problems
• The Fermat-Weber location problem revisited
• The effect of deterministic noise in subgradient methods
• Methods of descent for nondifferentiable optimization
• Convergence analysis for the modified spectral projected subgradient method
• Graph Implementations for Nonsmooth Convex Programs
• First-Order Methods in Optimization
• Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• A Nonmonotone Line Search Technique for Newton’s Method