Budget Amount *help |
¥7,280,000 (Direct Cost: ¥5,600,000、Indirect Cost: ¥1,680,000)
Fiscal Year 2021: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2020: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2019: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2018: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2017: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
|
Outline of Final Research Achievements |
While non-convex optimization problems are hard to solve in general, this research has focused on those problems that have geometrical backgrounds and investigated a methodology to design efficient algorithms for obtaining globally optimal solutions. In particular, we have developed an efficient algorithm for non-convex quadratic constraint quadratic programming (QCQP) with one constraint. In addition, we exploit this algorithm to obtain relaxation solutions for general non-convex QCQP with the aid of the Lagrange multipliers.
|