Abstract
The authors have derived what they termed quasi-Newton multi step methods in [2]. These methods have demonstrated substantial numerical improvements over the standard single step Secant-based BFGS. Such methods use a variant of the Secant equation that the updated Hessian (or its inverse) satisfies at each iteration. In this paper, new methods will be explored for which the updated Hessians satisfy multiple relations of the Secant-type. A rational model is employed in developing the new methods. The model hosts a free parameter which is exploited in enforcing symmetry on the updated Hessian approximation matrix thus obtained. The numerical performance of such techniques is then investigated and compared to other methods. Our results are encouraging and the improvements incurred supercede those obtained from other existing methods at minimal extra storage and computational overhead.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ford, J.A., Moghrabi, I.A.: Using function-values in multi-step quasi-Newton methods. J. Comput. Appl. Math. 66, 201–211 (1996)
Ford, J.A., Moghrabi, I.A.: Multi-step quasi-Newton methods for optimization. J. Comput. Appl. Math. 50, 305–323 (1994)
Ford, J.A., Moghrabi, I.A.: Alternative parameter choices for multi-step quasi-Newton methods. Optim. Methods Softw. 2, 357–370 (1993)
Ford, J.A., Saadallah, A.F.: A rational function model for unconstrained optimization. Colloq. Math. Soc. János Bolyai 50, 539–563 (1986)
Dennis, J.E., Schnabel, R.B.: Least change secant updates for quasi-Newton methods. SIAM Rev. 21, 443–459 (1979)
Ford, J.A., Ghandhari, R.A.: On the use of function-values in unconstrained optimisation. J. Comput. Appl. Math. 28, 187–198 (1989)
Ford, J.A., Ghandhari, R.A.: Efficient utilization of function-values in quasi-Newton methods. Colloq. Math. Soc. János Bolyai 59, 49–64 (1990)
Ford, J.A., Ghandhari, R.A.: On the use of curvature estimates in quasi-Newton methods. J. Comput. Appl. Math. 35, 185–196 (1991)
Fletcher, R.: Practical Methods of Optimization, 2nd edn. Wiley, New York (1987)
Broyden, C.G.: The convergence of a class of double-rank minimization algorithms – Part 2: The new algorithm. J. Inst. Math. Applic. 6, 222–231 (1970)
Fletcher, R.: A new approach to variable metric algorithms. Comput. J. 13, 317–322 (1970)
Goldfarb, D.: A family of variable metric methods derived by variational means. Math. Comp. 24, 23–26 (1970)
Shanno, D.F.: Conditioning of quasi-Newton methods for function minimization. Math. Comp. 24, 647–656 (1970)
Shanno, D.F., Phua, K.H.: Matrix conditioning and nonlinear optimization. Math. Program. 14, 149–160 (1978)
Brent, R.: Algorithms for Minimization without Derivatives. Prentice-Hall, Englewood Cliffs, New Jersey (1973)
Salane, D., Tewarson, R.P.: On symmetric minimum norm updates. IMA J. Numer. Anal. 9(1), 235–240 (1983)
Byrd, R.H., Schnabel, R.B., Shultz, G.A.: Parallel quasi-Newton methods for unconstrained optimization. Math. Program. 42, 273–306 (1988)
Al-Baali, M.: Extra updates for the BFGS Method. OMS 13, 159–179 (2000)
More, J.J., Garbow, B.S., Hillstrom, K.E.: Testing unconstrained optimization software. ACM Trans. Math. Softw. 7, 17–41 (1981)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Moghrabi, I.A.R. Numerical Experience with Multiple Update Quasi-Newton Methods for Unconstrained Optimization. J Math Model Algor 6, 231–238 (2007). https://doi.org/10.1007/s10852-006-9038-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10852-006-9038-1