New Quasi-Newton (Dfp) With Logistic Mapping
Keywords:
Unconstrained optimization, Quasi-Newton methods, DFP method, Logistic mappingAbstract
In this paper, we propose a modification of the self-scaling quasi-Newton (DFP) method for unconstrained optimization using logistic mapping. We shoe that it produces a positive definite matrix. Numerical results demonstrate that the new algorithm is superior to standard DFP method with respect to the NOI and NOF.
References
Lu Hui-juan, ZHANG Huo-ming and MA Long-hua: A new optimization algorithm based on chaos. Journal of Zhejiang University SCIENCE A, 7(4), 2006.
Shanno, D. F. and Kettler, P. C.: Optimal Conditioning of Quasi- Newton methods. Mathematics of Computation. Volume 24, number 111, 1970.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2016 Salah G. Shareef, Bayda G. Fathi

This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License [CC BY-NC-SA 4.0] that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work, with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online.