Abstract

Difference of Convex functions (DC) Programming and DC Algorithm (DCA) constitute the backbone of Nonconvex Programming and Global Optimization. The paper is devoted to the State of the Art with recent advances of DC Programming and DCA to meet the growing need for nonconvex optimization and global optimization, both in terms of mathematical modeling as in terms of efficient scalable solution methods. After a brief summary of these theoretical and algorithmic tools, we outline the main results on convergence of DCA in DC programming with subanalytic data, exact penalty techniques with/without error bounds in DC programming including mixed integer DC programming, DCA for general DC programs, and DC programming involving the ℓ0-norm via its approximation and penalization.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.