Approximating K‐means‐type Clustering via Semidefinite Programming

From MaRDI portal
Publication:5444287

DOI10.1137/050641983zbMath1146.90046OpenAlexW1986219860MaRDI QIDQ5444287

Yu Wei, Jiming Peng

Publication date: 25 February 2008

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/050641983




Related Items (48)

On the minimum of the mean-squared error in 2-means clusteringMixed-Projection Conic Optimization: A New Paradigm for Modeling Rank ConstraintsThe Ratio-Cut Polytope and K-Means ClusteringImproved Conic Reformulations for $K$-means ClusteringFuzzy clustering: more than just fuzzificationDiffusion \(K\)-means clustering on manifolds: provable exact recovery via semidefinite relaxationsModel assisted variable clustering: minimax-optimal recovery and algorithmsProbably certifiably correct \(k\)-means clusteringLearning doubly stochastic and nearly idempotent affinity matrix for graph-based clusteringJoint Community Detection and Rotational Synchronization via Semidefinite ProgrammingAn exact algorithm for semi-supervised minimum sum-of-squares clusteringA new perspective on low-rank optimizationA competitive optimization approach for data clustering and orthogonal non-negative matrix factorizationCertifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clusteringReconciling business analytics with graphically initialized subspace clustering for optimal nonlinear pricingSOS-SDP: An Exact Solver for Minimum Sum-of-Squares ClusteringA Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite ProgrammingSolving graph equipartition SDPs on an algebraic varietyUnnamed ItemEfficient, certifiably optimal clustering with applications to latent variable graphical modelsMixed-integer programming techniques for the minimum sum-of-squares clustering problemSemidefinite programming based community detection for node-attributed networks and multiplex networksClustering subgaussian mixtures by semidefinite programmingAn efficient approach to solve the large-scale semidefinite programming problemsHanson-Wright inequality in Hilbert spaces with application to \(K\)-means clustering for non-Euclidean dataEnsemble clustering using semidefinite programming with applicationsGuaranteed clustering and biclustering via semidefinite programmingOn the equivalence of inexact proximal ALM and ADMM for a class of convex composite programmingSize Matters: Cardinality-Constrained Clustering and Outlier Detection via Conic OptimizationNon-convex clustering via proximal alternating linearized minimization methodSDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraintsUnnamed ItemOn semidefinite relaxations for the block modelImproving spectral bounds for clustering problems by Lagrangian relaxationWhen do birds of a feather flock together? \(k\)-means, proximity, and conic programmingConvex relaxation methods for community detectionAn Efficient Inexact ABCD Method for Least Squares Semidefinite ProgrammingOptimality of spectral clustering in the Gaussian mixture modelSDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)Distance preserving model order reduction of graph-Laplacians and cluster analysisAn empirical comparison of two approaches for CDPCA in high-dimensional dataExact Clustering of Weighted Graphs via Semidefinite ProgrammingPartial recovery bounds for clustering with the relaxed \(K\)-meansUnnamed ItemCovariate Regularized Community Detection in Sparse GraphsUnnamed ItemA Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type ConstraintsHidden Integrality and Semirandom Robustness of SDP Relaxation for Sub-Gaussian Mixture Model


Uses Software



This page was built for publication: Approximating K‐means‐type Clustering via Semidefinite Programming