SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering (Q5106412)

scientific article; zbMATH DE number 7587562

Language	Label	Description	Also known as
English	SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering	scientific article; zbMATH DE number 7587562

Statements

instance of

scholarly article

0 references

title

SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering (English)

0 references

0 references

0 references

0 references

INFORMS Journal on Computing

0 references

publication date

19 September 2022

0 references

full work available at URL

https://arxiv.org/abs/2104.11542

0 references

zbMATH Keywords

clustering

0 references

semidefinite programming

0 references

branch-and-bound

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering

0 references

An improved column generation algorithm for minimum sum-of-squares clustering

0 references

NP-hardness of Euclidean sum-of-squares clustering

0 references

Q2934696

0 references

Relax, No Need to Round

0 references

Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems

0 references

A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning

0 references

Q5180702

0 references

sGDML: constructing accurate and data efficient molecular force fields using machine learning

0 references

The partition problem

0 references

Constrained clustering by constraint programming

0 references

SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning

0 references

The Ratio-Cut Polytope and K-Means Clustering

0 references

Evaluation of a Branch and Bound Algorithm for Clustering

0 references

An Interior Point Algorithm for Minimum Sum-of-Squares Clustering

0 references

A branch-and-cut algorithm based on semidefinite programming for the minimum $k$-partition problem

0 references

J-MEANS: A new local search heuristic for minimum sum of squares clustering

0 references

Probably certifiably correct $k$-means clustering

0 references

Rigorous Error Bounds for the Optimal Value in Semidefinite Programming

0 references

A local search approximation algorithm for $k$-means clustering

0 references

New diagonal bundle method for clustering problems in large data sets

0 references

A Branch and Bound Clustering Algorithm

0 references

New and efficient DCA based algorithms for minimum sum-of-squares clustering

0 references

When do birds of a feather flock together? $k$-means, proximity, and conic programming

0 references

Least squares quantization in PCM

0 references

Q5617409

0 references

The planar $k$-means problem is NP-hard

0 references

Clustering subgaussian mixtures by semidefinite programming

0 references

Approximating K‐means‐type Clustering via Semidefinite Programming

0 references

Q5701392

0 references

Improved Conic Reformulations for $K$-means Clustering

0 references

Cluster Analysis and Mathematical Programming

0 references

Silhouettes: a graphical aid to the interpretation and validation of cluster analysis

0 references

Q4247442

0 references

A global optimization RLT-based approach for solving the hard clustering problem

0 references

SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints

0 references

A Newton-CG Augmented Lagrangian Method for Semidefinite Programming

0 references

Identifiers

DOI

10.1287/ijoc.2022.1166

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5106412