| Budget Amount *help |
¥4,160,000 (Direct Cost: ¥3,200,000、Indirect Cost: ¥960,000)
Fiscal Year 2011: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2010: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2009: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
|
|---|
| Research Abstract |
We developed sequential partial optimization algorithms for fundamental continuous convex programming problems such as linear programs and convex quadratic programs, and evaluated their characteristics and efficiency through global convergence analysis and numerical experiments. We also carried out theoretical analysis and development of efficient algorithms for various optimization problems arising in the field of information and communication technology. To be more specific, we studied research issues such as efficient computation methods for nonnegative matrix factorization, optimal design methods for recurrent neural networks, maximizing clustering coefficient of complex networks, and optimization of the topology of multi-agent networks for fast consensus, and obtained many important results.
|
