Loading…
A Modified Davidon-Fletcher-Powell Method for Solving Nonlinear Optimization Problems
One of the quasi-Newton update formulae, namely the Davidon-Fletcher-Powell method, is crucial for resolving nonlinear programming optimization problems. In order to achieve a Newton-like condition that depends on the function values and gradient vectors at each iteration, we construct an alter...
Saved in:
Published in: | Iraqi journal of science 2024-03, p.1476-1484 |
---|---|
Main Authors: | , , , |
Format: | Article |
Language: | English |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | One of the quasi-Newton update formulae, namely the Davidon-Fletcher-Powell method, is crucial for resolving nonlinear programming optimization problems. In order to achieve a Newton-like condition that depends on the function values and gradient vectors at each iteration, we construct an alternative positive-definite Hessian approximation in this study. The essential theorems are established to study algorithm convergence. The proposed approach is then tested on well-known test problems and then compared to the standard DFP method. The numerical outcomes demonstrate the effectiveness of the newly developed method. |
---|---|
ISSN: | 0067-2904 2312-1637 |
DOI: | 10.24996/ijs.2024.65.3.25 |