Conic Programming: Degeneracy and Modeling
| Project/Area Number |
26330025
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Research Field |
Mathematical informatics
|
|---|
| Research Institution | The University of Electro-Communications |
|---|
Principal Investigator |
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
土谷 隆 政策研究大学院大学, 政策研究科, 教授 (00188575)
|
|---|
| Project Period (FY) |
2014-04-01 – 2018-03-31
|
| Project Status |
Completed (Fiscal Year 2017)
|
| Budget Amount *help |
¥4,550,000 (Direct Cost: ¥3,500,000、Indirect Cost: ¥1,050,000)
Fiscal Year 2016: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2015: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2014: ¥1,950,000 (Direct Cost: ¥1,500,000、Indirect Cost: ¥450,000)
|
|---|
| Keywords | 錐線形計画 / 半正定値計画 / ２次錐計画 / モデリング / 多項式計画 / 退化 / Conic linear programming / facial reduction / weak infeasibility / 弱許容性 / 弱非許容性 / 完全正値行列 |
|---|
| Outline of Final Research Achievements |
It is known that the semidefinite programming (SDP) relaxation method for polynomial optimization problems (POPs) can sometimes find the optimal value of POP although the true optimal value of SDP is different from the value. We gave a theoretical explanation for the mysterious phenomenon. This result is exactly to accomplish (part of) the original research objective. In addition, we gave new theoretical findings on degeneracy such as weak infeasibility in second-order programming problems and SDPs. In particular, we propose a new decomposition method for conic feasibility problems, and succeeded in shrinking the feasibility problem into smaller problems.
|
Report
(5 results)
Research Products
(26 results)
