DC programmingNonsmooth optimizationVariational analysisOptimization methods for difference-of-convex programs iteratively solve convex subproblems to define iterates. Although convex, depending on the problem's structure, these subproblems are very often challenging and require specialized solvers. This work ...
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...
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...
Due to the use of the ramp loss function, the corresponding objective function is nonconvex, making it more challenging. To overcome this limitation, we formulate our distance metric learning problem as an instance of difference of convex functions (DC) programming. This allows us to design a ...
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...
Paper tables with annotated results for Further properties of the forward-backward envelope with applications to difference-of-convex programming
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 ...
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....
difference of two convex CPWL functions. Any convex CPWL function can be represented as the maximum of a set of affine functions, so thepolytopesdefining a DC CPWL function can be implicitly defined by the affine functions. By simply searching the parameters of affine functions, CPWL ...
D. Melzer: 1986, ‘On the expressibility of piecewise-linear continuous functionsss as the difference of two piecewise-linear convex functions,’Mathematical Programming Study 29 , 118-134.Melzer, D. (1986). On the expressibility of piecewise- linear continuous functions as a difference of two ...