Convergence and stability of line search methods for unconstrained optimization

6Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper explores the stability of general line search methods in the sense of Lyapunov, for minimizing a smooth nonlinear function. In particular we give sufficient conditions for a line search method to be globally asymptotical stable. Our analysis suggests that the proposed sufficient conditions for asymptotical stability is equivalent to the Zoutendijk-type conditions in conventional global convergence analysis. © 2013 Springer Science+Business Media Dordrecht.

Cite

CITATION STYLE

APA

Leong, W. J., & Goh, B. S. (2013). Convergence and stability of line search methods for unconstrained optimization. Acta Applicandae Mathematicae, 127(1), 155–167. https://doi.org/10.1007/s10440-012-9796-x

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