Two relaxation methods for rank minimization problems (Q2198528): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10957-020-01731-9 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10957-020-01731-9 / rank | |||
Normal rank | |||
Latest revision as of 11:05, 17 December 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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
