Weak Recovery Conditions from Graph Partitioning Bounds and Order Statistics

DOI10.1287/moor.1120.0581zbMath1336.94027arXiv1004.5151OpenAlexW2107186957MaRDI QIDQ5169663

Alexandre d'Aspremont, Noureddine El Karoui

Publication date: 11 July 2014

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1004.5151

zbMATH Keywords

semidefinite programmingcompressed sensingcorrelation clustering\(k\)-dense-subgraph

Mathematics Subject Classification ID

Semidefinite programming (90C22) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (1)

Convex Relaxations for Permutation Problems

This page was built for publication: Weak Recovery Conditions from Graph Partitioning Bounds and Order Statistics