Efficient ODE-based methods for unconstrained optimization
This paper presents some efficient methods for unconstrained optimization based upon approximating the gradient flow of the objective function. Most ODE-based methods would generate Levenberg-Marquardt-like steps that require the solution of linear systems. On the other hand our proposed methods use...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Faculty of Science, Universiti Putra Malaysia
2018
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/72536/1/Efficient%20ODE.pdf http://psasir.upm.edu.my/id/eprint/72536/ https://einspem.upm.edu.my/ojs/index.php/dismath/article/view/28 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This paper presents some efficient methods for unconstrained optimization based upon approximating the gradient flow of the objective function. Most ODE-based methods would generate Levenberg-Marquardt-like steps that require the solution of linear systems. On the other hand our proposed methods used some quasi-Newton matrices to approximate the solution of these linear systems, thus avoiding the solution of linear systems repeatedly. Two implementations of the modified ODE-based methods - line search and trust region implementation are proposed. Under some suitable assumptions, the convergence of the proposed methods is then established. Numerical results indicate that the modified methods are more effective and comparable than the standard line search and trust region method using the well-known BFGS formula. |
|---|