A nonmonotone trust region method with new inexact line search for unconstrained optimization (Q369443)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6210989
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A nonmonotone trust region method with new inexact line search for unconstrained optimization |
scientific article; zbMATH DE number 6210989 |
Statements
A nonmonotone trust region method with new inexact line search for unconstrained optimization (English)
0 references
24 September 2013
0 references
The authors introduce a nonmonotone rule and incorporate the nonmonotone strategy into the trust region method for solving unconstrained optimization problems. The proposed algorithm does not restrict the objective function values to be monotonically decreasing. The algorithm combines line search to find an iterative point instead of resolving the trust region subproblems. The global convergence of the algorithm is established under certain conditions. Some numerical results are presented to show the efficiency of the algorithm.
0 references
unconstrained optimization
0 references
inexact line search
0 references
trust region method
0 references
global convergence
0 references
numerical experiments
0 references
algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0.96741253
0 references
0.96107674
0 references
0.95976645
0 references
0.9597241
0 references
0.95858276
0 references
0.9584255
0 references
0.9576324
0 references
0.9565872
0 references
