Year: 2012
Type: article
Abstract: 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.
Authors: Nour E. Rahali, Nacera Djeghaba, Rachid Benzine
Language: English
Subfield: Numerical Analysis
Field: Mathematics
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W2724563185
