scientific article; zbMATH DE number 7753389
zbMATH Open1522.90137MaRDI QIDQ6076201FDOQ6076201
Authors: Abdellatif Moudafi 
Publication date: 23 October 2023
Full work available at URL: http://yokohamapublishers.jp/online2/oppafa/vol8/p847.html
Title of this publication is not available (Why is that?)
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
regularizationDC minimizationproximity mapping(approximate) stationary pointdescent gradient iterationsdifference of convex functions (DC)Moreau-envelope
Numerical optimization and variational techniques (65K10) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Numerical methods based on nonlinear programming (49M37)
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
- Title not available (Why is that?)
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)
