Gradient set splitting in nonconvex nonsmooth numerical optimization
From MaRDI portal
Publication:3562383
DOI10.1080/10556780903236911zbMath1190.90140OpenAlexW2085267852MaRDI QIDQ3562383
Enrico Gorgone, Manlio Gaudioso
Publication date: 21 May 2010
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780903236911
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)
Related Items (7)
New diagonal bundle method for clustering problems in large data sets ⋮ Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization ⋮ Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations ⋮ Codifferential method for minimizing nonsmooth DC functions ⋮ Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming ⋮ Essentials of numerical nonsmooth optimization ⋮ Essentials of numerical nonsmooth optimization
Uses Software
This page was built for publication: Gradient set splitting in nonconvex nonsmooth numerical optimization
