A generalized subgradient method with piecewise linear subproblem

MaRDI QIDQ3070576zbMATH OpenFDO

Authors Asef Nazari Ganjehlou, Julien Ugon, A. M. Bagirov

Publication date 3 February 2011

zbMATH Keywords

bundle methodnonconvex optimizationnonsmooth optimizationsubdifferentialsubgradient methods

Mathematics Subject Classification ID

Spline approximation (41A15) Best approximation, Chebyshev systems (41A50) Nonsmooth analysis (49J52) Numerical methods based on nonlinear programming (49M37) Nonconvex programming, global optimization (90C26)

Recommendations

• Subgradient method for nonconvex nonsmooth optimization
• Convergence of a generalized subgradient method for nondifferentiable convex optimization
• A quasisecant method for minimizing nonsmooth functions
• A quasi-Newton bundle method based on approximate subgradients
• An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization

Cited in

(4)

• Generalized Peaceman-Rachford splitting method with substitution for convex programming
• Subgradient method for nonconvex nonsmooth optimization
• A quasisecant method for minimizing nonsmooth functions
• scientific article; zbMATH DE number 4128317 (Why is no real title available?)

This page was built for publication: A generalized subgradient method with piecewise linear subproblem

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