Convex Optimization for the Densest Subgraph and Densest Submatrix Problems.
Polina BombinaBrendan P. W. AmesPublished in: Oper. Res. Forum (2020)
Keyphrases
- convex optimization
- convex relaxation
- convex optimization problems
- convex programming
- graph mining
- low rank
- similarity graph
- interior point methods
- semi definite programming
- optimization problems
- total variation
- natural images
- primal dual
- image compression
- norm minimization
- linear programming
- convex constraints
- image segmentation
- convex formulation
- basis pursuit