Numerical performance of subgradient methods in solving nonsmooth optimization problems

DOI10.11721/CQNUJ20130606MaRDI QIDQ2923993zbMATH OpenFDO

Authors Qiang Long, Jueyou Li

Publication date 3 November 2014

Published in Journal of Chongqing Normal University. Natural Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.11721/CQNUJ20130606

zbMATH Keywords

subgradient methodsnonsmooth optimization problemstep size rules

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Recommendations

• A numerical study of applying spectral-step subgradient method for solving nonsmooth unconstrained optimization problems
• Quasi-monotone subgradient methods for nonsmooth convex minimization
• A subgradient method for unconstrained nonconvex nonsmooth optimization
• Subgradient and bundle methods for nonsmooth optimization
• scientific article; zbMATH DE number 2084877

Cited in

(6)

• The Practical Performance of Subgradient Computational Techniques for Mesh Network Utility Optimization
• A computational evaluation of two subgradient search methods
• A numerical study of applying spectral-step subgradient method for solving nonsmooth unconstrained optimization problems
• A system of nonsmooth equations solver based upon subgradient method
• Subgradient optimization in nonsmooth optimization (including the soviet revolution)
• Weak subgradient method for solving nonsmooth nonconvex optimization problems

This page was built for publication: Numerical performance of subgradient methods in solving nonsmooth optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2923993)