| Project/Area Number |
18560052
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Engineering fundamentals
|
|---|
| Research Institution | University of Tsukuba |
|---|
Principal Investigator |
YOSHISE Akiko University of Tsukuba, Graduate School of Systems and Information Engineering, Professor (50234472)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
FUJISAWA Katsuki University of Tsukuba, Graduate School of Systems and Information Engineering, Associate Professor (40303854)
YAMAMOTO Yoshitsugu University of Tsukuba, Graduate School of Systems and Information Engineering, Professor (00119033)
KUNO Takahito University of Tsukuba, Graduate School of Systems and Information Engineering, Associate Professor (00205113)
SHIGENO Maiko University of Tsukuba, Graduate School of Systems and Information Engineering, Associate Professor (40272687)
MURAMATSU Masakazu University of Tsukuba, Graduate School of Systems and Information Engineering, Associate Professor (70266071)
|
|---|
| Project Period (FY) |
2006 – 2007
|
| Project Status |
Completed (Fiscal Year 2007)
|
| Budget Amount *help |
¥3,490,000 (Direct Cost: ¥3,100,000、Indirect Cost: ¥390,000)
Fiscal Year 2007: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
Fiscal Year 2006: ¥1,800,000 (Direct Cost: ¥1,800,000)
|
|---|
| Keywords | Optimization / Semidefinite programming / Interior point method / Homogeneous algorithm / Complementarity problem / Nonlinear optimization |
|---|
| Research Abstract |
The aim of this research is to develop numerically stable primal-dual interior point methods foe solving nonlinear semidefinite programming problems. The semidefinite programming problem is an optimization problem over a closed convex cone that is not polyhedral unlike the linear programming problem. By this reason, we often observe a problem which has an asymptotic optimal solution but no optimal solution, I.e., any sequence on which the object value converges to the optimal value diverges. This brings us a numerical difficulty in determining the optimality when we apply interior point algorithms to solve the problem. A high accuracy of an optimal solution of the problem is critical if we adopt the problem as an approximation model of a combinatorial optimization problem or a robust optimization problem. To overcome the difficulty, many techniques have been proposed for obtaining a numerical stability of the algorithms. Such techniques are more highly expected when we solve nonlinear semidefinite programming problems. In order to provide one of such techniques, we introduced a homogeneous model for the nonlinear semidefinite programming problem, and showed that for the homogeneous model, (a) a bounded path having a trivial starting point exists, (b) any accumulation point of the path is a solution of the homogeneous model, c if the original problem is solvable then it gives us a finite solution, (d) if the original problem is strongly infeasible, then it gives us a finite certificate proving infeasibility, and (e) a class of algorithms for numerically tracing the path in (a) solves the problem in a polynomial number of iterations under a moderate assumption
|
