The following pages link to Relax, No Need to Round (Q2989030):
Displayed 10 items.
- Probably certifiably correct \(k\)-means clustering (Q1675259) (← links)
- A note on probably certifiably correct algorithms (Q1695210) (← links)
- Applied harmonic analysis and data processing. Abstracts from the workshop held March 25--31, 2018 (Q1731982) (← links)
- On semidefinite relaxations for the block model (Q1747735) (← links)
- Partial recovery bounds for clustering with the relaxed \(K\)-means (Q2319817) (← links)
- Efficient, certifiably optimal clustering with applications to latent variable graphical models (Q2425167) (← links)
- Improved Conic Reformulations for $K$-means Clustering (Q4555446) (← links)
- (Q4614130) (← 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)