The DC (Difference of Convex Functions) Programming and DCA Revisited with DC Models of Real World Nonconvex Optimization Problems

Author： An Le   Tao Pham  

Publisher： Springer Publishing Company

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.133, Iss.1-4, 2005-01, pp. : 23-46

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A new efficient algorithm based on DC programming and DCA for clustering

By An Le   Belghiti M.   Tao Pham  

Journal of Global Optimization, Vol. 37, Iss. 4, 2007-04 ,pp. : 593-608

Springer Publishing Company

Access to resources Recommend Favorite

Optimality Conditions for D.C. Vector Optimization Problems Under Reverse Convex Constraints

By Gadhi N.   Laghdir M.   Metrane A.  

Journal of Global Optimization, Vol. 33, Iss. 4, 2005-12 ,pp. : 527-540

Springer Publishing Company

Access to resources Recommend Favorite

Hybrid Mean-Variance Mapping Optimization for Non-Convex Economic Dispatch Problems

By  

International Journal of Swarm Intelligence Research (IJSIR), Vol. 8, Iss. 4, 2017-10 ,pp. : 34-59

IGI Global_journal

Access to resources Recommend Favorite

On duality theory for non-convex semidefinite programming

By Sun Wenyu   Li Chengjin   Sampaio Raimundo  

Annals of Operations Research, Vol. 186, Iss. 1, 2011-06 ,pp. : 331-343

Springer Publishing Company

Access to resources Recommend Favorite

Duality and optimality conditions for generalized equilibrium problems involving DC functions

By Dinh N.   Strodiot J.   Nguyen V.  

Journal of Global Optimization, Vol. 48, Iss. 2, 2010-10 ,pp. : 183-208

Springer Publishing Company

Access to resources Recommend Favorite