THE NEW RANK ONE CLASS FOR UNCONSTRAINED PROBLEMS SOLVING
One of the most well-known methods for unconstrained problems is the quasi-Newton approach, iterative solutions. The great precision and quick convergence of the quasi-Newton methods are well recognized. In this work, the new algorithm for the symmetric rank one SR1 method is driven. The strong W...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Zakho
2023-04-01
|
| Series: | Science Journal of University of Zakho |
| Subjects: | |
| Online Access: | https://sjuoz.uoz.edu.krd/index.php/sjuoz/article/view/1049 |
| Summary: | One of the most well-known methods for unconstrained problems is the quasi-Newton approach, iterative solutions. The great precision and quick convergence of the quasi-Newton methods are well recognized. In this work, the new algorithm for the symmetric rank one SR1 method is driven.
The strong Wolfe line search criteria define the step length selection. We also proved the new quasi-Newton equation and positive definite matrix theorem. Preliminary computer testing on the set of fourteen unrestricted optimization test functions leads to the conclusion that this new method is more effective and durable than the implementation of classical SR1 method in terms of iterations count and functions.
|
|---|---|
| ISSN: | 2663-628X 2663-6298 |