Pages that link to "Item:Q717132"

The following pages link to Nuclear norm minimization for the planted clique and biclique problems (Q717132):

Displaying 27 items.

• Convex optimization for the densest subgraph and densest submatrix problems (Q142862) (← links)
• \(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)
• Finding a low-rank basis in a matrix subspace (Q517309) (← links)
• Null space conditions and thresholds for rank minimization (Q633114) (← links)
• Community detection in sparse networks via Grothendieck's inequality (Q737326) (← 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)
• Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables (Q1628128) (← links)
• A simple spectral algorithm for recovering planted partitions (Q1678989) (← links)
• Tensor clustering with planted structures: statistical optimality and computational limits (Q2119244) (← links)
• A divide-and-conquer algorithm for binary matrix completion (Q2187387) (← 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)
• Euclidean Distance Matrices and Applications (Q2802549) (← links)
• Recovering a hidden community beyond the Kesten–Stigum threshold in <i>O</i>(|<i>E</i>|log^*|<i>V</i>|) time (Q4684942) (← links)
• Computational and statistical tradeoffs via convex relaxation (Q5170958) (← links)
• On the Complexity of Robust PCA and <i>ℓ</i>₁-Norm Low-Rank Matrix Approximation (Q5219689) (← links)
• Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning (Q5870483) (← links)
• Clustering heterogeneous financial networks (Q6196293) (← links)