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

DOI10.1007/s10898-006-9066-4zbMath1198.90327OpenAlexW2089343684MaRDI QIDQ2385500

M. Tayeb Belghiti, Hoai An Le Thi, Tao Pham Dinh

Publication date: 12 October 2007

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-006-9066-4

zbMATH Keywords

Clustering DCA DC programming K-means algorithm K-median problem Nonsmooth nonconvex programming

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10)

Related Items

DCA based algorithms for multiple sequence alignment (MSA), DC approximation approaches for sparse optimization, Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model, The Confrontation of Two Clustering Methods in Portfolio Management: Ward’s Method Versus DCA Method, Binary classification via spherical separator by DC programming and DCA, Minimizing differences of convex functions with applications to facility location and clustering, Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems, Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms, Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm, Unnamed Item, A new linearization method for generalized linear multiplicative programming, New and efficient DCA based algorithms for minimum sum-of-squares clustering, New diagonal bundle method for clustering problems in large data sets, A novel optimization approach towards improving separability of clusters, A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program, Open issues and recent advances in DC programming and DCA, An incremental bundle method for portfolio selection problem under second-order stochastic dominance, Qualitative properties of the minimum sum-of-squares clustering problem, A DC programming approach for feature selection in support vector machines learning, Block Clustering Based on Difference of Convex Functions (DC) Programming and DC Algorithms, Efficient Nonnegative Matrix Factorization by DC Programming and DCA, An intelligent multi-criteria optimization method for quick and market-oriented textile material design, A DC Programming Approach for Finding Communities in Networks, Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms, An improved column generation algorithm for minimum sum-of-squares clustering, Clustering and multifacility location with constraints via distance function penalty methods and dc programming, DCA based algorithms for feature selection in multi-class support vector machine, DC programming and DCA: thirty years of developments, Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering, A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique, A branch and reduce approach for solving a class of low rank d.c. programs, A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems, Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming

Cites Work