Research on Numerical Methods for Large-Scale Nonlinear Optimization Problems and their Applications to Software Codes
| Project/Area Number |
16510123
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Social systems engineering/Safety system
|
|---|
| Research Institution | Tokyo University of Science |
|---|
Principal Investigator |
YABE Hiroshi Tokyo University of Science, Faculty of Science, Professor, 理学部, 教授 (90158056)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
YAMAKI Naokazu Shizuoka University, Faculty of Engineering, Professor, 工学部, 教授 (20120222)
NUMATA Kazumichi Tokyo University of Science, Faculty of Engineering, Associate Professor, 工学部, 助教授 (30106893)
OGASAWARA Hideho Tokyo University of Science, Faculty of Science, Junior Associate Professor, 理学部, 講師 (00231217)
|
|---|
| Project Period (FY) |
2004 – 2006
|
| Project Status |
Completed (Fiscal Year 2006)
|
| Budget Amount *help |
¥3,100,000 (Direct Cost: ¥3,100,000)
Fiscal Year 2006: ¥900,000 (Direct Cost: ¥900,000)
Fiscal Year 2005: ¥900,000 (Direct Cost: ¥900,000)
Fiscal Year 2004: ¥1,300,000 (Direct Cost: ¥1,300,000)
|
|---|
| Keywords | nonlinear optimization / nonlinear programming / semidefinite programming / conjugate gradient method / memory gradient method / quasi-Newton method / Newton method / primal-dual interior point method / 記憶制限法 / 2次錐計画問題 / サポートベクターマシーン / 2次錐計画 |
|---|
| Research Abstract |
We have studied numerical methods for solving unconstrained and constrained optimization problems. Specifically, we have done the following.
(1) We have proposed new nonlinear conjugate gradient methods based on the modified secant and the multi-step secant conditions for solving large-scale unconstrained optimization problems. We have proved their global convergence properties. Our numerical experiments show that our proposed methods perform well.
(2) We have proposed a new memory gradient method for solving large-scale unconstrained optimization problems. We have proved their global convergence properties. Our numerical experiments show that our proposed method performs well.
(3) We have combined the limited memory quasi-Newton method, which was proposed by us, and the primal-dual interior point method to solve nonlinearly constrained optimization problems.
(4) We have analyzed local behavior of the primal-dual interior point method for degenerate nonlinear optimization problems.
(5) We have proposed primal-dual interior point methods for solving nonlinear second-order cone programming and nonlinear semidefinite programming problems. We have proved their global convergence properties by using primal-dual merit function within the framework of the line search strategy.
(6) We have proved the local and q-superlinear convergence of the quasi-Newton method with the Broyden family based on the modified secant condition for solving unconstrained optimization problems.
(7) We have dealt with the Barzilai-Borwein method to improve numerical performance of the steepest descent method, and we have proposed the extended Barzilai-Borwein method.
|
Report
(4 results)
Research Products
(20 results)
