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 8 items.
- Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones (Q621748) (← links)
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion (Q717129) (← links)
- Faster, but weaker, relaxations for quadratically constrained quadratic programs (Q742292) (← links)
- Solving large-scale semidefinite programs in parallel (Q868469) (← links)
- A parallel interior point decomposition algorithm for block angular semidefinite programs (Q969720) (← links)
- Bounds on heat transfer for Bénard–Marangoni convection at infinite Prandtl number (Q5226290) (← 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)
