Two relaxation methods for rank minimization problems (Q2198528)
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: Two relaxation methods for rank minimization problems |
scientific article; zbMATH DE number 7246142
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two relaxation methods for rank minimization problems |
scientific article; zbMATH DE number 7246142 |
Statements
Two relaxation methods for rank minimization problems (English)
0 references
10 September 2020
0 references
constraint qualification
0 references
optimality conditions
0 references
rank minimization
0 references
semidefinite programs with complementarity constraints
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8462693095207214
0 references
0.8114756345748901
0 references
0.7862158417701721
0 references
0.7774620056152344
0 references
0.7771954536437988
0 references
