4,420,000 Yen
(Direct Cost: 3,400,000 Yen Indirect Cost: 1,020,000 Yen)
Research Abstract
In this study we develop conic-programming-based analysis and synthesis of linear positive dynamical systems. In dealing with the analysis and synthesis of general (non-positive) linear dynamical systems, the effectiveness of the semidefinite programming problem (SDP) is widely recognized where an SDP is an optimization problem over the positive semidefinite cone. However, when dealing with the analysis and synthesis of positive systems with strong positive properties, it is natural to employ the copositive programming problem (COP) where a COP is an optimization problem over the copositive cone. From this view point, we mainly derived COP-based analysis and synthesis conditions for positive systems in this study.
