A numerical study of applying spectral-step subgradient method for solving nonsmooth unconstrained optimization problems

DOI10.1016/j.cor.2018.12.006zbMath1458.49023OpenAlexW2902819572MaRDI QIDQ1725601

Xianqiang Yang

Publication date: 14 February 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2018.12.006

zbMATH Keywords

nonsmooth optimizationnonmonotone line searchsubgradient methodsspectral gradient methods

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Numerical methods based on necessary conditions (49M05)

Related Items (1)

A subgradient method with non-monotone line search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectral projected subgradient with a momentum term for the Lagrangean dual approach
• Modified spectral projected subgradient method: convergence analysis and momentum parameter heuristics
• Nonsmooth spectral gradient methods for unconstrained optimization
• Convergence analysis for the modified spectral projected subgradient method
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• Two-Point Step Size Gradient Methods
• Gradient Method with Retards and Generalizations
• A Nonmonotone Line Search Technique for Newton’s Method
• On the Barzilai and Borwein choice of steplength for the gradient method
• Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
• Benchmarking optimization software with performance profiles.

This page was built for publication: A numerical study of applying spectral-step subgradient method for solving nonsmooth unconstrained optimization problems