eng Ansari Education and Research Society Journal of Ultra Scientist of Physical Sciences December 2008 20 3 841 847 jusps-B 1414 article An Efficient Step Size For BFGS Azfi Zaidi Mohammad Sofi (azfizaidi@yahoo.com) 1 Mustafa Mamat (mus@umt.edu.my) 1 Ismail Mohd (ismail@umt.edu.my. 1 Yosza Dasril (yosza@utem.edu.my 2 Department of Mathematics, Facutly of Science and Technology, University Malaysia Terengganu (UMT) (Malaysia) Faculty of Electronics and Computer Engineering Universiti Teknikal Meaka (UTem) Melaka, Malaysia <p style="text-align: justify;">In this paper we introduced what we are calling a combination of step size of Broyden-Fletcher-Goldfarb-Shanno (CSS-BFGS) to solve unconstrained optimization problem. Analytically, we have proved that the algorithm is superlinearly convergence. The numerical result of CSS-BFGS was shown at the end of this paper. The result shown that in term of iteration number <em>n<sub>i</sub></em> and function evaluation <em>n<sub>f</sub></em>, our alternative step size is more effective than the original BFGS algorithm.<br /> &nbsp;</p> https://ultraphysicalsciences.org/paper/1414/ exact line search step size BFGS differebtiable superlinearly convergence