Global convergence of the Armijo epsilon steepest descent algorithm
Journal of Numerical Analysis and Approximation Theory · 01.08.2012 · 41 (2) · 169-180
DOI: 10.33993/jnaat412-978 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Numerical Analysis and Approximation Theory, online erschienen am 01.08.2012. Verfasst von Nour E. Rahali und 2 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 36 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
In this article, we study the unconstrained minimization problem\[(P)\,\,\,\min\left\{ f(x):x\in\mathbb{R}^{n}\right\} .\]where \(f:\mathbb{R}^{n}\rightarrow\mathbb{R}\) is a continuously differentiable function. We introduce a new algorithm which accelerates the convergence of the steepest descent method. We further establish the global convergence of this algorithm in the case of Armijo inexact line search.
Zitieren
APA
Rahali, N. E., Djeghaba, N., & Benzine, R. (2012). Global convergence of the Armijo epsilon steepest descent algorithm. Journal of Numerical Analysis and Approximation Theory, 41(2), 169-180. https://doi.org/10.33993/jnaat412-978
Vancouver
Rahali NE, Djeghaba N, Benzine R. Global convergence of the Armijo epsilon steepest descent algorithm. Journal of Numerical Analysis and Approximation Theory. 2012;41(2):169-180. doi:10.33993/jnaat412-978
BibTeX
@article{Rahali2012,
author = {Rahali, Nour E. and Djeghaba, Nacera and Benzine, Rachid},
title = {Global convergence of the Armijo epsilon steepest descent algorithm},
journal = {Journal of Numerical Analysis and Approximation Theory},
year = {2012},
volume = {41},
number = {2},
pages = {169--180},
doi = {10.33993/jnaat412-978}
}
EUVIMED