Exploiting sparsity in the coefficient matching conditions in sum-of-squares programming using ADMM
This letter introduces an efficient first-order method based on the alternating direction method of multipliers (ADMM) to solve semidefinite programs arising from sum-of-squares (SOS) programming. We exploit the sparsity of the coefficient matching conditions when SOS programs are formulated in the...
| প্রধান লেখক: | , , |
|---|---|
| বিন্যাস: | Journal article |
| প্রকাশিত: |
IEEE
2017
|