A feasible method for general convex low-rank SDP problems (Q6573007)
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 feasible method for general convex low-rank SDP problems |
scientific article; zbMATH DE number 7881519
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A feasible method for general convex low-rank SDP problems |
scientific article; zbMATH DE number 7881519 |
Statements
A feasible method for general convex low-rank SDP problems (English)
0 references
16 July 2024
0 references
semidefinite programming
0 references
feasible method
0 references
Riemannian optimization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
