An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems
Our interest lies in solving sum of squares (SOS) relaxations of large-scale unconstrained polynomial optimization problems. Because interior-point methods for solving these problems are severely limited by the large-scale, we are motivated to explore efficient implementations of an accelerated firs...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis,
2014-06-06T17:27:23Z.
|
| Subjects: | |
| Online Access: | Get fulltext |