Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4645450 | Applied Numerical Mathematics | 2011 | 10 Pages |
Abstract
This paper presents a hybrid trust region algorithm for unconstrained optimization problems. It can be regarded as a combination of ODE-based methods, line search and trust region techniques. A feature of the proposed method is that at each iteration, a system of linear equations is solved only once to obtain a trial step. Further, when the trial step is not accepted, the method performs an inexact line search along it instead of resolving a new linear system. Under reasonable assumptions, the algorithm is proven to be globally and superlinearly convergent. Numerical results are also reported that show the efficiency of this proposed method.
Related Topics
Physical Sciences and Engineering
Mathematics
Computational Mathematics