An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity (Q5162656)
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: An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity |
scientific article; zbMATH DE number 7421061
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity |
scientific article; zbMATH DE number 7421061 |
Statements
An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity (English)
0 references
5 November 2021
0 references
semidefinite programs
0 references
storage optimality
0 references
low rank
0 references
complementary slackness
0 references
primal recovery
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
