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...
Difference of convex functions programmingDifference of convex functions algorithmDifference of convex functions constraintsPenalty functionWe address a large class of Mathematical Programs with Linear Complementarity Constraints which minimizes a continuously differentiable DC function (Difference of Convex functions...
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
(IKSVM with Difference of Convex Functions Programming,IKSVM-DC).在此基础上,考虑到多核学习(Multiple Kernel Learning,MKL)可以有效避免核参数选择和提高分类器... 胥海明 - 东南大学 被引量: 0发表: 2018年 A maximum margin clustering algorithm based on indefinite kernels IKMMC firstly transforms the ...
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 ...
1993: On the use of a modified Newton method for nonlinear finite element analysis.Comp. Meth. Appl. Mech. Engrg. 110, 275–283 Hiriart-Urruty J.-B. 1985: Generalized differentiability, duality and optimization for problems dealing with differences of convex functions. In: Ponstein, J. (...
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) ...
The nonconvex constrained minimization problem for a differentiable function that can be written as the difference of two convex functions is examined. Global optimality conditions are given for a point and a minimizing sequence. A global search strategy based on these conditions is developed, and it...
A bundle Bregman proximal method for convex nondifferentiable minimization We give a method for minimizing a convex function f that generates a sequence {x[sup k]} by taking x[sup k] to be an approximate minimizer of f[sup k] + D[... KC Kiwiel - 《Mathematical Programming》 被引量: ...