| Budget Amount *help |
¥3,600,000 (Direct Cost: ¥3,000,000、Indirect Cost: ¥600,000)
Fiscal Year 2012: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2011: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2010: ¥1,000,000 (Direct Cost: ¥1,000,000)
|
|---|
| Research Abstract |
Due to powerful solvers, a variety of large-scale optimization problems can be solved in a small amount of time. Nonlinear optimization problems are, however, excluded from this benefit, especially when the convexity is not assumed. In this research, we paid attention to the fact that almost all nonlinear optimization problems can be formulated into a class of problems of minimizing a concave function over a convex set, and developed some deterministic algorithms for solving it. We verified that each of them converges in theory to an optimal solution, and that it actually terminates in a practical amount of time on a computer.
|
