Approximation of copositive programming via linear programming using second order sum of square decomposition
In this paper, we improve the previously known result of approximating the cone of copositive matrices. We approximate the cone of copositive matrices by a set of linear matrices inequalities using the second order sum of square decomposition. Hence, a copositive programming can be approximated more...
Saved in:
| Main Authors: | , |
|---|---|
| 格式: | 雜誌 |
| 出版: |
2018
|
| 主題: | |
| 在線閱讀: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84856527771&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/50106 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Chiang Mai University |
| 總結: | In this paper, we improve the previously known result of approximating the cone of copositive matrices. We approximate the cone of copositive matrices by a set of linear matrices inequalities using the second order sum of square decomposition. Hence, a copositive programming can be approximated more accurately by a linear programming. |
|---|