Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
From MaRDI portal
Publication:2416961
DOI10.1016/j.patcog.2015.11.011zbMath1412.68200MaRDI QIDQ2416961
Julien Ugon, Adil M. Bagirov, Sona Taheri
Publication date: 27 May 2019
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2015.11.011
cluster analysis; non-convex optimization; non-smooth optimization; incremental clustering algorithms
62H30: Classification and discrimination; cluster analysis (statistical aspects)
90C26: Nonconvex programming, global optimization
68T10: Pattern recognition, speech recognition
Related Items
Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming, Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization, Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms, New diagonal bundle method for clustering problems in large data sets, DC programming algorithm for clusterwise linear \(L_1\) regression, Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering, Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations, A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact penalty and error bounds in DC programming
- Fast global \(k\)-means clustering based on local geometrical information
- Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions
- Fast modified global \(k\)-means algorithm for incremental cluster construction
- New and efficient DCA based algorithms for minimum sum-of-squares clustering
- Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
- Fast global \(k\)-means clustering using cluster membership and inequality
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
- A method of truncated codifferential with application to some problems of cluster analysis
- Variable neighborhood decomposition search
- DC programming: overview.
- A heuristic algorithm for solving the minimum sum-of-squares clustering problems
- An incremental clustering algorithm based on hyperbolic smoothing
- A new efficient algorithm based on DC programming and DCA for clustering
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- The hyperbolic smoothing clustering method
- Introduction to Nonsmooth Optimization
- Finding the nearest point in A polytope
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- Evaluation of a Branch and Bound Algorithm for Clustering
- An algorithm for minimizing clustering functions
