Pages that link to "Item:Q142862"
From MaRDI portal
The following pages link to Convex optimization for the densest subgraph and densest submatrix problems (Q142862):
Displaying 6 items.
- admmDensestSubmatrix (Q142863) (← links)
- Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation (Q896191) (← links)
- (Q2226481) (redirect page) (← links)
- Convex optimization for the planted \(k\)-disjoint-clique problem (Q2436653) (← links)
- Finding Planted Subgraphs with Few Eigenvalues using the Schur--Horn Relaxation (Q4609470) (← links)
- On convergence of a \(q\)-random coordinate constrained algorithm for non-convex problems (Q6635808) (← links)