Aggregate subgradient smoothing methods for large scale nonsmooth nonconvex optimisation and applications

DOI10.1017/S0004972715000143MaRDI QIDQ5253358zbMATH OpenFDO

Authors N. Sultanova

Publication date 5 June 2015

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0004972715000143

zbMATH Keywords

large-scale problemsmathematical programmingnonsmooth optimisation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Applications of mathematical programming (90C90)

Recommendations

• scientific article; zbMATH DE number 2084877
• Aggregate subgradient method for nonsmooth DC optimization
• A subgradient method for unconstrained nonconvex nonsmooth optimization
• Subgradient method for nonconvex nonsmooth optimization
• Smoothing methods for nonsmooth, nonconvex minimization

Cited in

(4)

• Aggregate subgradient method for nonsmooth DC optimization
• A geometric integration approach to nonsmooth, nonconvex optimisation
• An aggregate subgradient methods for nonsmooth constrained minimization
• Weak subgradient method for solving nonsmooth nonconvex optimization problems

This page was built for publication: Aggregate subgradient smoothing methods for large scale nonsmooth nonconvex optimisation and applications

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