Pages that link to "Item:Q1411643"
From MaRDI portal
The following pages link to Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results (Q1411643):
Displaying 3 items.
- Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization (Q5737726) (← links)
- Cardinality-constrained distributionally robust portfolio optimization (Q6112845) (← links)
- A graphic structure based branch-and-bound algorithm for complex quadratic optimization and applications to magnitude least-square problem (Q6183088) (← links)