A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion (Q2236545)
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: A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7979080080986023
0 references
0.7876179814338684
0 references
0.7876179814338684
0 references
0.7837934494018555
0 references
0.7686697840690613
0 references
