SparseCoLO
From MaRDI portal
Software:16934
No author found.
Related Items (13)
Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems ⋮ Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures ⋮ Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization ⋮ COSMO: a conic operator splitting method for convex conic problems ⋮ Decomposition of arrow type positive semidefinite matrices with application to topology optimization ⋮ Binary quadratic optimization problems that are difficult to solve by conic relaxations ⋮ Exploiting Structured Sparsity in Large Scale Semidefinite Programming Problems ⋮ Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion ⋮ Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion ⋮ Chordal decomposition in operator-splitting methods for sparse semidefinite programs ⋮ Universal Rigidity and Edge Sparsification for Sensor Network Localization ⋮ Bounds on heat transfer for Bénard–Marangoni convection at infinite Prandtl number ⋮ Bounds on heat transport for convection driven by internal heating
This page was built for software: SparseCoLO
