scientific article; zbMATH DE number 7753389

MaRDI QIDQ6076201zbMATH OpenFDO

Authors Abdellatif Moudafi

Publication date 23 October 2023

Full work available at URL http://yokohamapublishers.jp/online2/oppafa/vol8/p847.html

zbMATH Keywords

regularizationDC minimizationproximity mapping(approximate) stationary pointdescent gradient iterationsdifference of convex functions (DC)Moreau-envelope

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Numerical methods based on nonlinear programming (49M37)

Recommendations

• How to regularize a difference of convex functions
• Proximal bundle methods for nonsmooth DC programming
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• New Bregman proximal type algoritms for solving DC optimization problems
• A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems

Cited in

(5)

• Beyond canonical dc-optimization: the single reverse polar problem
• On a DC-optimization-problem from statistical factor analysis
• How to regularize a difference of convex functions
• DC optimization for constructing discrete Sugeno integrals and learning nonadditive measures
• scientific article; zbMATH DE number 7522492 (Why is no real title available?)

This page was built for publication:

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