Finding sparse, equivalent SDPs using minimal coordinate projections
We present a new method for simplifying SDPs that blends aspects of symmetry reduction with sparsity exploitation. By identifying a subspace of sparse matrices that provably intersects (but doesn't necessarily contain) the set of optimal solutions, we both block-diagonalize semidefinite constra...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2019
|
| Online Access: | https://hdl.handle.net/1721.1/121539 |