Pages that link to "Item:Q2848995"
From MaRDI portal
The following pages link to Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint (Q2848995):
Displaying 6 items.
- Unique low rank completability of partially filled matrices (Q326825) (← links)
- Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope (Q740647) (← links)
- Symmetric completions of cycles and bipartite graphs (Q2229479) (← links)
- A new graph parameter related to bounded rank positive semidefinite matrix completions (Q2248754) (← links)
- Solving rank-constrained semidefinite programs in exact arithmetic (Q2409017) (← links)
- DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization (Q5382573) (← links)
