Name
Abstract | ||
|---|---|---|
In this paper, we propose a new regularized quasi-Newton method for unconstrained optimization. At each iteration, a regularized quasi-Newton equation is solved to obtain the search direction. The step size is determined by a non-monotone Armijo backtracking line search. An adaptive regularized parameter, which is updated according to the step size of the line search, is employed to compute the next search direction. The presented method is proved to be globally convergent. Numerical experiments show that the proposed method is effective for unconstrained optimizations and outperforms the existing regularized Newton method. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/s11590-018-1236-z | Optimization Letters |
Keywords | Field | DocType |
Unconstrained optimization, Regularized quasi-Newton method, Non-monotone line search | Applied mathematics,Quasi-Newton method,Mathematical optimization,Backtracking line search,Line search,Mathematics,Newton's method | Journal |
Volume | Issue | ISSN |
12 | 7 | 1862-4472 |
Citations | PageRank | References |
0 | 0.34 | 10 |
Authors | ||
2 | ||