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 ...
详细信息
ISBN:
(纸本)9783642544552;9783642544545
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 dcprogramming 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 dcprogramming with subanalytic data, exactpenalty techniques with/without errorbounds in dcprogramming including mixed integer dcprogramming, dcA for general dc programs, and dcprogramming involving the l(0)-norm via its approximation and penalization.
暂无评论