Convex optimization for the densest subgraph and densest submatrix problems
Polina Bombina, Brendan Ames
Year of publication: |
2020
|
---|---|
Authors: | Bombina, Polina ; Ames, Brendan |
Published in: |
Operations research forum. - Cham : Springer International Publishing, ISSN 2662-2556, ZDB-ID 2978290-9. - Vol. 1.2020, 3, Art.-No. 23, p. 1-24
|
Subject: | Densest subgraph | Submatrix localization | Nuclear norm relaxation | Maximum clique | Alternating direction method of multipliers | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Multiplikator | Multiplier |
Saved in:
Online Resource
Saved in favorites
Similar items by subject
-
Numerical study of learning algorithms on Stiefel manifold
Kanamori, Takafumi, (2014)
-
Sparse portfolio selection via the sorted l1-Norm
Kremer, Philipp J., (2020)
-
Hong, Mingyi, (2020)
- More ...