A New Symmetric Rank One Algorithm for Unconstrained Optimization
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. ...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | Arabic |
| Published: |
Mosul University
2011-12-01
|
| Series: | Al-Rafidain Journal of Computer Sciences and Mathematics |
| Subjects: | |
| Online Access: | https://csmj.mosuljournals.com/article_163637_e7691436373582ce6d143e691dd00ce2.pdf |