The following pages link to SparseCoLO (Q16934):
Displayed 13 items.
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion (Q717129) (← links)
- Binary quadratic optimization problems that are difficult to solve by conic relaxations (Q1751225) (← links)
- Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization (Q1949261) (← links)
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion (Q2039245) (← links)
- Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures (Q2182857) (← links)
- COSMO: a conic operator splitting method for convex conic problems (Q2231337) (← links)
- Decomposition of arrow type positive semidefinite matrices with application to topology optimization (Q2235142) (← links)
- Chordal decomposition in operator-splitting methods for sparse semidefinite programs (Q2297655) (← links)
- Universal Rigidity and Edge Sparsification for Sensor Network Localization (Q3083321) (← links)
- Bounds on heat transport for convection driven by internal heating (Q4993136) (← links)
- Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems (Q5038440) (← links)
- Bounds on heat transfer for Bénard–Marangoni convection at infinite Prandtl number (Q5226290) (← links)
- Exploiting Structured Sparsity in Large Scale Semidefinite Programming Problems (Q5747848) (← links)