No label defined (Q4215028)
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 1217672
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1217672 |
Statements
12 April 1999
0 references
numerical experiments
0 references
trust region algorithm
0 references
nonmonotone algorithms
0 references
descent methods
0 references
convergence
0 references
CUTE
0 references
0.8137808442115784
0 references
0.8003490567207336
0 references
0.7899109125137329
0 references
0.7889718413352966
0 references
Nonmonotone algorithms developed so far include the corresponding descent methods as special cases. As convergence analysis commonly deals with worst case scenarios, nonmonotone algorithms are not expected to have theoretically better convergence properties than descent methods. Judgement on nonmonotone algorithms has to be based on extensive numerical experimentation. Fortunately, CUTE [cf. \textit{I. Bongartz}, \textit{A. R. Conn}, \textit{N. Gould} and \textit{Ph. L. Toint}, ACM Trans. Math. Softw. 21, No. 1, 123-160 (1995; Zbl 0886.65058)] provides an ideal test environment. The purpose of this paper is to propose a new nonmonotone stabilization trust region (NSTR) algorithm, modifying earlier work [cf. \textit{F. Zhou} and \textit{Y. Xiao}, Computing 53, No. 2, 119-136 (1994; Zbl 0834.90127)], and assess our NSTR algorithm in CUTE. For the entire collection see [Zbl 0897.00034].
0 references
