Pages that link to "Item:Q5444287"

The following pages link to Approximating K‐means‐type Clustering via Semidefinite Programming (Q5444287):

Displayed 46 items.

• Guaranteed clustering and biclustering via semidefinite programming (Q463740) ‎ (← links)
• SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints (Q499161) ‎ (← links)
• On the minimum of the mean-squared error in 2-means clustering (Q1624878) ‎ (← links)
• Probably certifiably correct \(k\)-means clustering (Q1675259) ‎ (← links)
• On semidefinite relaxations for the block model (Q1747735) ‎ (← links)
• An efficient approach to solve the large-scale semidefinite programming problems (Q1955162) ‎ (← links)
• Ensemble clustering using semidefinite programming with applications (Q1959572) ‎ (← links)
• Convex relaxation methods for community detection (Q2038282) ‎ (← links)
• Optimality of spectral clustering in the Gaussian mixture model (Q2054516) ‎ (← links)
• Distance preserving model order reduction of graph-Laplacians and cluster analysis (Q2059823) ‎ (← links)
• An empirical comparison of two approaches for CDPCA in high-dimensional data (Q2062344) ‎ (← links)
• Model assisted variable clustering: minimax-optimal recovery and algorithms (Q2176610) ‎ (← links)
• Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering (Q2189394) ‎ (← links)
• Hanson-Wright inequality in Hilbert spaces with application to \(K\)-means clustering for non-Euclidean data (Q2214261) ‎ (← links)
• On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming (Q2220656) ‎ (← links)
• When do birds of a feather flock together? \(k\)-means, proximity, and conic programming (Q2288194) ‎ (← links)
• Partial recovery bounds for clustering with the relaxed \(K\)-means (Q2319817) ‎ (← links)
• Fuzzy clustering: more than just fuzzification (Q2397885) ‎ (← links)
• Efficient, certifiably optimal clustering with applications to latent variable graphical models (Q2425167) ‎ (← links)
• Diffusion \(K\)-means clustering on manifolds: provable exact recovery via semidefinite relaxations (Q2659762) ‎ (← links)
• Learning doubly stochastic and nearly idempotent affinity matrix for graph-based clustering (Q2670543) ‎ (← links)
• An exact algorithm for semi-supervised minimum sum-of-squares clustering (Q2676354) ‎ (← links)
• An Efficient Inexact ABCD Method for Least Squares Semidefinite Programming (Q2805705) ‎ (← links)
• Improved Conic Reformulations for $K$-means Clustering (Q4555446) ‎ (← links)
• Clustering subgaussian mixtures by semidefinite programming (Q4603713) ‎ (← links)
• (Q4614130) ‎ (← links)
• Exact Clustering of Weighted Graphs via Semidefinite Programming (Q4633040) ‎ (← links)
• Size Matters: Cardinality-Constrained Clustering and Outlier Detection via Conic Optimization (Q4634103) ‎ (← links)
• Non-convex clustering via proximal alternating linearized minimization method (Q4634919) ‎ (← links)
• Improving spectral bounds for clustering problems by Lagrangian relaxation (Q4918244) ‎ (← links)
• SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0) (Q4972547) ‎ (← links)
• (Q4998873) ‎ (← links)
• Covariate Regularized Community Detection in Sparse Graphs (Q4999151) ‎ (← links)
• (Q5053241) ‎ (← links)
• Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints (Q5060505) ‎ (← links)
• The Ratio-Cut Polytope and K-Means Clustering (Q5062119) ‎ (← links)
• Joint Community Detection and Rotational Synchronization via Semidefinite Programming (Q5097498) ‎ (← links)
• SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering (Q5106412) ‎ (← links)
• (Q5149255) ‎ (← links)
• A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints (Q5254992) ‎ (← links)
• Hidden Integrality and Semirandom Robustness of SDP Relaxation for Sub-Gaussian Mixture Model (Q5868965) ‎ (← links)
• A new perspective on low-rank optimization (Q6052053) ‎ (← links)
• A competitive optimization approach for data clustering and orthogonal non-negative matrix factorization (Q6057712) ‎ (← links)
• A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming (Q6116234) ‎ (← links)
• Mixed-integer programming techniques for the minimum sum-of-squares clustering problem (Q6166100) ‎ (← links)
• Semidefinite programming based community detection for node-attributed networks and multiplex networks (Q6171278) ‎ (← links)