Annals of Operations ResearchThe DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems - An, Tao - 2005H. A Le Thi and T. Pham Dinh. The dc (difference of convex functions) programming and ...
DifferenceOfConvex(DC) FunctionsandDCProgramming SongcanChen Outline 1.ABriefHistory 2.DCFunctionsandtheirProperty 3.Someexamples 4.DCProgramming 5.CaseStudy 6.Ournextwork 1.ABriefHistory •1964,HoangTuy,(incidentallyinhisconvex optimizationpaper), •1979,J.F.Toland,Dualityformulation •1985,Pham...
optimization, Bosted difference of convex... Learn more about optimization, dc-problem, mathematics Optimization Toolbox
^The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functionshttps://doi.org/10.1137/18M123339X
Quasiconvex functionDifference of quasiconvex functionsQ-subdifferentialOptimality conditionsIn this note, we are concerned with an optimization problem (P) where the objective function is the difference of two quasiconvex functions. Using a suitable subdifferential introduced by Suzuki and Kuroiwa (...
Gaudioso, M., Giallombardo, G., Miglionico, G.: Minimizing piecewise-concave functions over polyhedra. Math. Oper. Res. 43(2), 580–597 (2018) Article MathSciNet Google Scholar An, L.T.H., Tao, P.D.: The DC (difference of convex functions) programming and DCA revisited with DC...
We develop advanced DCAs (Difference of Convex functions Algorithms) for these problems, which are based on DC Programming and DCA – the powerful tools for non-smooth non-convex optimization problems. Firstly, we consider the problem of group variable selection in multi-class logistic regression....
DCA的收敛性完全可以保证，这是由于DCA是一个单调算法，也就是说，如果你要用DCA去minimize一个objective...
An approach to supervised distance metric learning based on difference of convex functions programming DML-dc contains the implementation of Distance Metric Learning using DC programming. For any question, please contact Bac Nguyen. Abstract Distance metric learning has motivated a great deal of research...
Two new penalty methods for sparse reconstruction are proposed based on two types of difference of convex functions (DC for short) programming in which the DC objective functions are the difference of l1 and lσ q norms and the difference of l1 and lr norms with r > 1. By introducing a ...