On polyhedral and second-order cone decompositions of semidefinite optimization problems
We study a cutting-plane method for semidefinite optimization problems, and supply a proof of the method's convergence, under a boundedness assumption. By relating the method's rate of convergence to an initial outer approximation's diameter, we argue the method performs well when ini...
| প্রধান লেখক: | , |
|---|---|
| অন্যান্য লেখক: | |
| বিন্যাস: | প্রবন্ধ |
| ভাষা: | English |
| প্রকাশিত: |
Elsevier BV
2021
|
| অনলাইন ব্যবহার করুন: | https://hdl.handle.net/1721.1/129965 |