References

Andrei, N., 2008. An unconstrained optimization test functions collection. Adv. Mod. Optimiz., 10: 147-161.
Direct Link  |  

Armijo, L., 1966. Minimization of functions having lipschitz continuous first partial derivatives. Pac. J. Math., 16: 1-3.
CrossRef  |  Direct Link  |  

Broyden, C.G., 1970. The convergence of a class of double-rank minimization algorithms 2: The new algorithm. IMA. J. Appl. Math., 6: 222-231.
Direct Link  |  

Byrd, R.H. and J. Nocedal, 1989. A tool for the analysis of quasi-Newton methods with application to unconstrained minimization. SIAM J. Numer. Anal., 26: 727-739.
CrossRef  |  

Chong, E.K.P. and S.H. Zak, 2001. An Introduction to Optimization. John Wiley and Sons, New York, pp: 365-433.

Dolan, E.D. and J.J. More, 2002. Benchmarking optimization software with performance profiles. Math. Program., 91: 201-213.
CrossRef  |  Direct Link  |  

Fletcher, R. and C.M. Reeves, 1964. Function minimization by conjugate gradients. Comput. J., 7: 149-154.
CrossRef  |  Direct Link  |  

Goldstein, A.A., 1965. On steepest descent. J. Soc. Indu. Appl. Math. Ser. A. Control, 3: 147-151.
Direct Link  |  

Hestenes, M.R. and E. Steifel, 1952. Method of conjugate gradient for solving linear equations. J. Res. Nat. Bur. Stand., 49: 409-436.
Direct Link  |  

Ibrahim, M.A.H., M. Mamat and W.J. Leong, 2014. The hybrid BFGS-CG method in solving unconstrained optimization problems. Abstract Appl. Anal., 2014: 1-6.
Direct Link  |  

Li, D.H. and M. Fukushima, 2001. A modified BFGS method and its global convergence in nonconvex minimization. J. Comput. Appl. Math., 129: 15-35.
Direct Link  |  

Liu, Y. and C. Storey, 1991. Efficient generalized conjugate gradient algorithms, part 1: Theory. J. Optimiz. Theory Applic., 69: 129-137.
CrossRef  |  Direct Link  |  

Mamat, M., I. Mohd, L.W. June and Y. Dasril, 2009. Hybrid broyden method for unconstrained optimization. Intl. J. Numer. Methods Appl., 1: 121-130.

Michalewicz, Z. and S.J. Hartley, 1996. Genetic Algorithms Data Structures Evolution Programs. Springer, Berlin, Germany, USA.,.

More, J.J., B.S. Grabow and K.E. Hillstrom, 1981. Testing unconstrained optimization software. ACM Trans. Math. Software, 7: 17-41.
Direct Link  |  

Shi, Z.J., 2006. Convergence of quasi-newton method with new inexact line search. J. Math. Anal. Appl., 315: 120-131.
Direct Link  |  

Wolfe, P., 1969. Convergence conditions for ascent method. SIAM Rev., 11: 226-235.
Direct Link  |  

Wolfe, P., 1971. Convergence conditions for ascent methods II: Some corrections. SIAM. Rev., 13: 185-188.
Direct Link  |  

Xu, D.C., 2003. Global convergence of the broyden's class of quasi-newton methods with nonmonotone linesearch. Acta Math. Appl. Sinica, 19: 19-24.
CrossRef  |  Direct Link  |