Partial Davidon, Fletcher and Powell (DFP) of quasi newton method for unconstrained optimization

Authors

  • Basheer M. Salih
  • Khalil K. Abbo
  • Zeyad M. Abdullah

DOI:

https://doi.org/10.25130/tjps.v21i6.1099

Keywords:

Unconstrained optimization; Davidon, Fletcher and Powell ; global convergence

Abstract

The nonlinear Quasi-newton methods is widely used in unconstrained optimization. However, In this paper, we developing new quasi-Newton method for solving unconstrained optimization problems. We consider once quasi-Newton which is (DFP) update formula, namely, Partial DFP. Most of quasi-Newton methods don't

always generate a descent search directions, so the descent or sufficient descent condition is usually assumed in the analysis and implementations . Descent property for the suggested method is proved. Finally, the numerical results show that the new method is also very efficient for general unconstrained optimizations.

Downloads

Published

2023-02-08

How to Cite

Basheer M. Salih, Khalil K. Abbo, & Zeyad M. Abdullah. (2023). Partial Davidon, Fletcher and Powell (DFP) of quasi newton method for unconstrained optimization. Tikrit Journal of Pure Science, 21(6), 180–186. https://doi.org/10.25130/tjps.v21i6.1099

Issue

Section

Articles