Finding Sparse Solutions for Packing and Covering Semidefinite Programs (Q5071107)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7510406
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding Sparse Solutions for Packing and Covering Semidefinite Programs |
scientific article; zbMATH DE number 7510406 |
Statements
Finding Sparse Solutions for Packing and Covering Semidefinite Programs (English)
0 references
20 April 2022
0 references
semidefinite programs
0 references
packing and covering
0 references
logarithmic potential
0 references
primal-dual algorithms
0 references
approximate solutions
0 references
robust packing and covering SDPs
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8687437772750854
0 references
0.8503014445304871
0 references
0.8425953984260559
0 references
0.8116528391838074
0 references
0.8067607879638672
0 references
