Minimum sum-of-squares clustering by dc programming and dca. In D.-S. Huang, K.-H. Jo, H.-H. Lee, H.-J. Kang, and V. Bevilacqua, editors, Emerging Intelligent Computing Technology and Applications. With As- pects of Artificial Intelligence (2009), 327-340.H. A. Le Thi and T....
The year 2015 marks the 30th birthday of DC (Difference of Convex functions) programming and DCA (DC Algorithms) which constitute the backbone of nonconvex programming and global optimization. In this article we offer a short survey on thirty years of developments of these theoretical and algorithm...
The DC programming and its DC algorithm (DCA) address the problem of minimizing a function f = g h (with g , h being lower semicontinuous proper convex functions on R n ) on the whole space. Based on local optimality conditions and DC duality, DCA was successfully applied to a lot of...
In general, it can be formulated as a DC (Difference of Convex functions) program for which the unified DC programming and DCA (DC Algorithms) are applied. In our works, we propose a new optimization model and a suitable DC decomposition for the model of MDPs. Numerical experiments are ...
4.DCProgramming •4.1PrimalProblem •4.2DualProblem •4.3DCAlgorithm(DCA) 4.1PrimalProblem •Ageneralform 0 inf{():,()0,1,2,...,} n i fxxXRfximα=∈⊆≤= Wheref i =g i -h i ,i=1,2,…,mareDCfunctionsandXis aclosedconvexsubsetofR n . Constrained(closed)SetXcanberepresent...
Le Thi, H.A., Pham Dinh, T.: The DC (Difference of Convex functions) programming and DCA revisited with DC models of real world non convex optimization problems. Ann. Oper. Res. 133, 23-46 (2005)Le Thi Hoai An and Pham Dinh Tao, "The DC (difference of con- vex functions) ...
Using an exact penalty technique and a decomposition technique, the original problem is transformed into an equivalent DC problem. DCA applied on the resulting problem gives the promising results.关键词: DC programming DCA inventory routing problem ...
[Advances in Intelligent Systems and Computing] Advanced Computational Methods for Knowledge Engineering Volume 358 || DC Programming and DCA Approach for ... HA Le Thi,NT Nguyen,TV Do 被引量: 0发表: 2015年 [Advances in Intelligent Systems and Computing] Advanced Computational Methods for ...
(2019). Correction to: Solving an Infinite-Horizon Discounted Markov Decision Process by DC Programming and DCA. In: Nguyen, T.B., van Do, T., An Le Thi, H., Nguyen, N.T. (eds) Advanced Computational Methods for Knowledge Engineering. Advances in Intelligent Systems and Computing, vol ...
We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly Cancel Create saved search Sign in Sign up Reseting focus {...