SparseCoLO

swMATH4768MaRDI QIDQ16934FDOQ16934

Author name not available (Why is that?)

Cited In (13)

• Chordal decomposition in operator-splitting methods for sparse semidefinite programs
• Exploiting Structured Sparsity in Large Scale Semidefinite Programming 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
• Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization
• 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
• Universal Rigidity and Edge Sparsification for Sensor Network Localization
• Bounds on heat transfer for Bénard–Marangoni convection at infinite Prandtl number
• Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems
• Bounds on heat transport for convection driven by internal heating
• Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures
• COSMO: a conic operator splitting method for convex conic problems

This page was built for software: SparseCoLO