| 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)
|
|---|
| 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.
|
