- All Journals
- Al-Qadisiyah University
- Basrah University
- Kirkuk University
- Mosul University
- The Iraqi Borad for Medical Specialization
- University of Anbar
- University of Technology
- Al Mustafa University
- Al-Zahraa University for Women
- Alnoor University
- Kunooz University
- Misan University
- Ninevah University
- Tikrit University
- University of Al-Hamdaniya
- University of Kerbala
An Efficient Line Search Algorithm for Large Scale Optimization | ||
| AL-Rafidain Journal of Computer Sciences and Mathematics | ||
| Article 3, Volume 7, Issue 1, 2010, Pages 35-49 PDF (447.19 K) | ||
| Document Type: Research Paper | ||
| DOI: 10.33899/csmj.2010.163845 | ||
| Authors | ||
| Abbas Y. Al-Bayati1; Ivan S. Latif2 | ||
| 1College of Computer Sciences and Mathematics University of Mosul, Mosul, Iraq | ||
| 2College of Scientific Education University of Salahaddin | ||
| Abstract | ||
| In this work we present a new algorithm of gradient descent type, in which the stepsize is computed by means of simple approximation of the Hessian Matrix to solve nonlinear unconstrained optimization function. The new proposed algorithm considers a new approximation of the Hessian based on the function values and its gradients in two successive points along the iterations one of them use Biggs modified formula to locate the new points. The corresponding algorithm belongs to the same class of superlinear convergent descent algorithms and it has been newly programmed to obtain the numerical results for a selected class of nonlinear test functions with various dimensions. Numerical experiments show that the new choice of the step-length required less computation work and greatly speeded up the convergence of the gradient algorithm especially, for large scaled unconstrained optimization problems. | ||
| Keywords | ||
| unconstrained Optimization; line search; Biggs Variable Metric Update; gradient descent algorithm | ||
|
Statistics Article View: 295 PDF Download: 268 |
||