An inexact line search approach using modified nonmonotone strategy for unconstrained optimization (Q2453471)

The authors are concerned with a new nonmonotone strategy and its application to the line search approach for unconstrained optimization problems of the following form: Minimize \(f(x)\), subject to \(x\), where \(f\) is a twice continuously differentiable function. The authors incorporate the proposed nonmonotone strategy into an inexact Armijo-type line search approach to construct a more relaxed line search procedure. The global convergence to first-order stationary points is proved and the \(R\)-linear convergence rate is established under suitable assumptions. Numerical results are given.