Convex optimization for the densest subgraph and densest submatrix problems (Q142862)
From MaRDI portal
(Redirected from Item:Q2226481)
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Convex optimization for the densest subgraph and densest submatrix problems |
scientific article; zbMATH DE number 7307556
- Convex optimization for the densest subgraph and densest submatrix problems
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Convex optimization for the densest subgraph and densest submatrix problems |
scientific article; zbMATH DE number 7307556 |
|
Statements
5 April 2019
0 references
8 February 2021
0 references
math.OC
0 references
cs.LG
0 references
stat.ML
0 references
Convex optimization for the densest subgraph and densest submatrix problems (English)
0 references
densest subgraph
0 references
submatrix localization
0 references
nuclear norm relaxation
0 references
maximum clique
0 references
alternating direction method of multipliers
0 references
0 references
0 references
0 references
0 references
0.8973763585090637
0 references
0.8019970655441284
0 references
0.7986794710159302
0 references
0.7724273800849915
0 references
0.7690494060516357
0 references
