Equivalence between the affine matrix rank minimization problem and the unconstrained matrix rank minimization problem (Q2824290)
From MaRDI portal
 | 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: Equivalence between the affine matrix rank minimization problem and the unconstrained matrix rank minimization problem |
scientific article; zbMATH DE number 6634899
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Equivalence between the affine matrix rank minimization problem and the unconstrained matrix rank minimization problem |
scientific article; zbMATH DE number 6634899 |
Statements
6 October 2016
0 references
affine matrix rank minimization problem
0 references
unconstrained penalty function
0 references
unconstrained matrix rank minimization problem
0 references
Equivalence between the affine matrix rank minimization problem and the unconstrained matrix rank minimization problem (English)
0 references
0.7884562611579895
0 references
0.7701082229614258
0 references
0.7699376940727234
0 references
