Publikationsdatum:
2017-05-13
Beschreibung:
The nonmonotone globalization technique is useful in difficult nonlinear problems, because of the fact that it may help escaping from steep sided valleys and may improve both the possibility of finding the global optimum and the rate of convergence. This paper discusses the nonmonotonicity degree of nonmonotone line searches for the unconstrained optimization. Specifically, we analyze some popular nonmonotone line search methods and explore, from a computational point of view, the relations between the efficiency of a nonmonotone line search and its nonmonotonicity degree. We attempt to answer this question how to control the degree of the nonmonotonicity of line search rules in order to reach a more efficient algorithm. Hence in an attempt to control the nonmonotonicity degree, two adaptive nonmonotone rules based on the morphology of the objective function are proposed. The global convergence and the convergence rate of the proposed methods are analysed under mild assumptions. Numerical experiments are made on a set of unconstrained optimization test problems of the CUTEr (Gould et al. in ACM Trans Math Softw 29:373–394, 2003 ) collection. The performance data are first analysed through the performance profile of Dolan and Moré (Math Program 91:201–213, 2002 ). In the second kind of analyse, the performance data are analysed in terms of increasing dimension of the test problems.
Print ISSN:
0008-0624
Digitale ISSN:
1126-5434
Thema:
Mathematik
