Gradient set splitting in nonconvex nonsmooth numerical optimization

DOI10.1080/10556780903236911MaRDI QIDQ3562383zbMATH OpenOpenAlexFDO

Authors E. Gorgone, Manlio Gaudioso

Publication date 21 May 2010

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556780903236911

zbMATH Keywords

bundle methodscutting planesnonsmooth optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)

Recommendations

• A splitting bundle approach for non-smooth non-convex minimization
• A cutting plane and level stabilization bundle method with inexact data for minimizing nonsmooth nonconvex functions
• Globally convergent cutting plane method for nonconvex nonsmooth minimization
• Bundle method for non-convex minimization with inexact subgradients and function values
• An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems

Cited in

(9)

• New diagonal bundle method for clustering problems in large data sets
• Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
• Double bundle method for finding Clarke stationary points in nonsmooth DC programming
• Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization
• A splitting bundle approach for non-smooth non-convex minimization
• Codifferential method for minimizing nonsmooth DC functions
• Essentials of numerical nonsmooth optimization
• Essentials of numerical nonsmooth optimization
• A descent subgradient method using Mifflin's line search for nonsmooth nonconvex optimization

Describes a project that uses

Uses Software

• DGM

This page was built for publication: Gradient set splitting in nonconvex nonsmooth numerical optimization

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