SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering
From MaRDI portal
Publication:5106412
DOI10.1287/ijoc.2022.1166OpenAlexW3158016150WikidataQ114058184 ScholiaQ114058184MaRDI QIDQ5106412
Angelika Wiegele, Antonio M. Sudoso, Veronica Piccialli
Publication date: 19 September 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.11542
Related Items
SOS-SDP, An exact algorithm for semi-supervised minimum sum-of-squares clustering, A unified framework for bivariate clustering and regression problems via mixed-integer linear programming, Mixed-integer programming techniques for the minimum sum-of-squares clustering problem
Uses Software
Cites Work
- The planar \(k\)-means problem is NP-hard
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- Constrained clustering by constraint programming
- A local search approximation algorithm for \(k\)-means clustering
- Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
- An improved column generation algorithm for minimum sum-of-squares clustering
- New and efficient DCA based algorithms for minimum sum-of-squares clustering
- NP-hardness of Euclidean sum-of-squares clustering
- Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
- Probably certifiably correct \(k\)-means clustering
- New diagonal bundle method for clustering problems in large data sets
- A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning
- When do birds of a feather flock together? \(k\)-means, proximity, and conic programming
- The partition problem
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
- A global optimization RLT-based approach for solving the hard clustering problem
- sGDML: constructing accurate and data efficient molecular force fields using machine learning
- Relax, No Need to Round
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- Rigorous Error Bounds for the Optimal Value in Semidefinite Programming
- A Branch and Bound Clustering Algorithm
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- Improved Conic Reformulations for $K$-means Clustering
- Clustering subgaussian mixtures by semidefinite programming
- Least squares quantization in PCM
- The Ratio-Cut Polytope and K-Means Clustering
- SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning
- Evaluation of a Branch and Bound Algorithm for Clustering
- Approximating K‐means‐type Clustering via Semidefinite Programming
- Cluster Analysis and Mathematical Programming
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
