A derivative-free nonmonotone line-search technique for unconstrained optimization

17Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.

Abstract

A tolerant derivative-free nonmonotone line-search technique is proposed and analyzed. Several consecutive increases in the objective function and also nondescent directions are admitted for unconstrained minimization. To exemplify the power of this new line search we describe a direct search algorithm in which the directions are chosen randomly. The convergence properties of this random method rely exclusively on the line-search technique. We present numerical experiments, to illustrate the advantages of using a derivative-free nonmonotone globalization strategy, with approximated-gradient type methods and also with the inverse SR1 update that could produce nondescent directions. In all cases we use a local variation finite differences approximation to the gradient. © 2007 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Diniz-Ehrhardt, M. A., Martínez, J. M., & Raydan, M. (2008). A derivative-free nonmonotone line-search technique for unconstrained optimization. Journal of Computational and Applied Mathematics, 219(2), 383–397. https://doi.org/10.1016/j.cam.2007.07.017

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free