Login / Signup
Convex optimization for the densest subgraph and densest submatrix problems.
Polina Bombina
Brendan Ames
Published in:
CoRR (2019)
Keyphrases
</>
convex optimization
convex programming
convex optimization problems
convex relaxation
similarity graph
interior point methods
graph mining
semi definite programming
primal dual
dense subgraphs
optimization problems
evolutionary algorithm
low rank
total variation
norm minimization
denoising
computer vision