A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion (Q2236545): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Optspace / rank | |||
Normal rank | |||
Revision as of 02:13, 1 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion |
scientific article |
Statements
A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion (English)
0 references
25 October 2021
0 references
semidefinite programming
0 references
interior point algorithms
0 references
low rank
0 references
matrix completion problems
0 references
