Optimization based DC programming and DCA for hierarchical clustering

DOI10.1016/j.ejor.2005.07.028zbMath1149.90117MaRDI QIDQ2643938

Tao Pham Dinh, Hoai An Le Thi, Le Hoai Minh

Publication date: 27 August 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.07.028

zbMATH Keywords

DCA; nonsmooth optimization; DC programming; nonconvex programs; bilevel hierarchical clustering

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

Related Items

Exact penalty and error bounds in DC programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On solving linear complementarity problems by DC programming and DCA
• Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Exact penalty in d. c. programming
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• A Survey of Recent Advances in Hierarchical Clustering Algorithms
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
• Combinatorial Image Analysis
• Combined SVM-based feature selection and classification