Global convergence of the Armijo epsilon steepest descent algorithm
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...
Main Authors: | Nour E. Rahali, Nacera Djeghaba, Rachid Benzine |
---|---|
Format: | Article |
Language: | English |
Published: |
Publishing House of the Romanian Academy
2012-08-01
|
Series: | Journal of Numerical Analysis and Approximation Theory |
Subjects: | |
Online Access: | https://www.ictp.acad.ro/jnaat/journal/article/view/978 |
Similar Items
-
Global convergence of the Armijo epsilon steepest descent algorithm
by: Nour E. Rahali, et al.
Published: (2012-08-01) -
Modification of the Armijo line search to satisfy the convergence properties of HS method
by: Mohammed Belloufi, et al.
Published: (2013-07-01) -
Enriching Elementary School Mathematical Learning with the Steepest Descent Algorithm
by: Roberto Araya
Published: (2021-05-01) -
On q-steepest descent method for unconstrained multiobjective optimization problems
by: Kin Keung Lai, et al.
Published: (2020-07-01) -
Target and Areas Coverage in Wireless Sensor Networks Using Analytical and Evolutionary Algorithms
by: Mohsen Sheikh-Hosseini, et al.
Published: (2022-03-01)