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 ...
Sequential equality-constrained optimization for nonlinear programming Article 03 May 2016 Convergence Analysis of Difference-of-Convex Algorithm with Subanalytic Data Article 26 July 2018 References Toland, J.F.: Duality in nonconvex optimization. J. Math. Anal. Appl. 66(2), 399–415 (1978...
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...
Paper tables with annotated results for Further properties of the forward-backward envelope with applications to difference-of-convex programming
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 ...
We discuss that learning the function in difference of convex form enables us to use difference of convex programming algorithms to find optimal inputs that optimizes the output. For illustration, we apply Convex Concave Procedure, a difference of Convex optimization algorithm which converts the opti...
An approach to supervised distance metric learning based on difference of convex functions programming - bacnguyencong/DML-dc
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-convex Complementarity constraints Penalty functions Bilevel programming Mathematics Subject Classification 90C05 Linear programming 90C30 Nonlinear programming 90C33 Complementarity and equilibrium problems and variational inequalities (finite dimensions) ...