Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections

DOI10.1007/s10898-021-01047-6zbMath1491.90141OpenAlexW3189663130MaRDI QIDQ2131141

Leo Liberti, Benedetto Manca

Publication date: 25 April 2022

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

Full work available at URL: https://doi.org/10.1007/s10898-021-01047-6

zbMATH Keywords

k-meansside constraintsMINLPrandom projections

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27)

Related Items (1)

Mixed-integer programming techniques for the minimum sum-of-squares clustering problem

Uses Software

• SCIP
• AMPL
• UCI-ml
• CPLEX
• Bonmin
• Ipopt
• ROSE
• Scikit
• Python

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mathematical programming: Turing completeness and applications to software analysis
• Constrained clustering by constraint programming
• An improved column generation algorithm for minimum sum-of-squares clustering
• An algorithmic framework for convex mixed integer nonlinear programs
• Solving mixed integer nonlinear programs by outer approximation
• Cluster analysis and mathematical programming
• Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
• Local branching
• Gaussian random projections for Euclidean membership problems
• Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
• Random projections for quadratic programs
• Random projections for quadratic programs over a Euclidean ball
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• The iterated exponential integers
• Static Analysis by Abstract Interpretation: A Mathematical Programming Approach
• Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
• Quantile Regression for Large-Scale Applications
• Dimensionality Reduction for k-Means Clustering and Low Rank Approximation
• Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence
• Randomized Sketches of Convex Programs With Sharp Guarantees
• Extensions of Lipschitz mappings into a Hilbert space
• Branching and bounds tighteningtechniques for non-convex MINLP
• Reformulations in Mathematical Programming: Definitions and Systematics
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• An Algorithm for Euclidean Sum of Squares Classification
• Numerical Experience with Lower Bounds for MIQP Branch-And-Bound
• An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
• High-Dimensional Probability
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• An elementary proof of a theorem of Johnson and Lindenstrauss
• Clustering Formulation Using Constraint Optimization
• Numerical linear algebra in the streaming model
• Oblivious dimension reduction for k -means: beyond subspaces and the Johnson-Lindenstrauss lemma
• Random Projections for Linear Programming
• Undecidability and hardness in mixed-integer nonlinear programming
• Constrained Clustering Using Column Generation

This page was built for publication: Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections