A new nonmonotone adaptive retrospective trust region method for unconstrained optimization problems (Q896192)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new nonmonotone adaptive retrospective trust region method for unconstrained optimization problems |
scientific article; zbMATH DE number 6520590
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new nonmonotone adaptive retrospective trust region method for unconstrained optimization problems |
scientific article; zbMATH DE number 6520590 |
Statements
A new nonmonotone adaptive retrospective trust region method for unconstrained optimization problems (English)
0 references
14 December 2015
0 references
This paper proposes a new method for resolving a nonlinear unconstrained optimization problem with a twice-differentiable objective profit function. The authors develop a non-monotone adaptive retrospective trust region method and thus prove the global convergence of the new algorithm with a super-linear rate of convergence. A monotone variant of the classical and retrospective ratios and new non-monotone ratios based on convex combinations of the monotone ones is introduced. The paper is improved finally by a numerical example to prove the efficiency and the effectiveness of the proposed theory.
0 references
adaptive techniques
0 references
non-monotone methods
0 references
global convergence
0 references
convex combinations
0 references
nonlinear unconstrained optimization
0 references
retrospective trust region method
0 references
algorithm
0 references
numerical example
0 references
0 references
0 references
0 references
0.8703487515449524
0 references
0.8543907403945923
0 references
0.8536125421524048
0 references
0.8530526161193848
0 references
0.8493039011955261
0 references