A New Symmetric Rank One Algorithm for Unconstrained Optimization

Section: Research Paper
Issue
Vol. 8 No. 2 (2011): Volume 8 Issue 2
Published
Jun 25, 2025
Pages
13-19

Abstract

In this paper, a new symmetric rank one for unconstrained optimization problems is presented. This new algorithm is used to solve symmetric and positive definite matrix. The new method is tested numerically by (7) nonlinear test functions and method is compared with the standard BFGS algorithm.
The new matrix used is symmetric and positive definite and it generates descent directions and satisfied QN-like condition.

Authors

Abbas Y. Al-Bayati

College of Computer Sciences and Mathematics University of Mosul, Mosul, Iraq

Salah G. Shareef

College of Education University of Zahko

Identifiers

Download this PDF file
PDF

Statistics

How to Cite

Y. Al-Bayati, A., عباس, G. Shareef, S., & صلاح. (2025). A New Symmetric Rank One Algorithm for Unconstrained Optimization. AL-Rafidain Journal of Computer Sciences and Mathematics, 8(2), 13–19. Retrieved from https://rjps.uomosul.edu.iq/index.php/csmj/article/view/19613