Two relaxation methods for rank minimization problems (Q2198528): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:35, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two relaxation methods for rank minimization problems |
scientific article |
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
