Minimizing the difference of convex and weakly convex functions via bundle method

DOI10.61208/PJO-2024-004MaRDI QIDQ6664322zbMATH OpenFDO

Authors Ksenia Syrtseva, Welington de Oliveira, Sophie Demassey, Wim van Ackooij

Publication date 16 January 2025

Published in Pacific Journal of Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.61208/PJO-2024-004

zbMATH Keywords

bundle methodsDC programmingnon-smooth optimizationweakly convex

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53) Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)

Recommendations

• Proximal bundle methods for nonsmooth DC programming
• A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems
• A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
• Convergence analysis of a proximal point algorithm for minimizing differences of functions
• A bundle-type method for nonsmooth DC programs

Cited in

(4)

• A proximal splitting algorithm for generalized DC programming with applications in signal recovery
• Contractive difference-of-convex algorithms
• A proximal-type method for nonsmooth and nonconvex constrained minimization problems
• A progressive decoupling algorithm for minimizing the difference of convex and weakly convex functions

This page was built for publication: Minimizing the difference of convex and weakly convex functions via bundle method

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