Pages that link to "Item:Q717132"
From MaRDI portal
The following pages link to Nuclear norm minimization for the planted clique and biclique problems (Q717132):
Displayed 15 items.
- \(s\)-goodness for low-rank matrix recovery (Q369686) (← links)
- Optimal detection of sparse principal components in high dimension (Q385763) (← links)
- An approximation theory of matrix rank minimization and its application to quadratic equations (Q417562) (← links)
- An implementable proximal point algorithmic framework for nuclear norm minimization (Q431025) (← links)
- Guaranteed clustering and biclustering via semidefinite programming (Q463740) (← links)
- A new approximation of the matrix rank function and its application to matrix rank minimization (Q481777) (← links)
- Extreme point inequalities and geometry of the rank sparsity ball (Q494341) (← links)
- A partial proximal point algorithm for nuclear norm regularized matrix least squares problems (Q495943) (← links)
- Null space conditions and thresholds for rank minimization (Q633114) (← links)
- Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation (Q896191) (← links)
- Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time (Q896557) (← links)
- Computational barriers in minimax submatrix detection (Q2352736) (← links)
- Do semidefinite relaxations solve sparse PCA up to the information limit? (Q2352742) (← links)
- Convex optimization for the planted \(k\)-disjoint-clique problem (Q2436653) (← links)
- Computational and statistical tradeoffs via convex relaxation (Q5170958) (← links)