Skip to main content
Log in

Numerical Experience with a Class of Self-Scaling Quasi-Newton Algorithms

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

Self-scaling quasi-Newton methods for unconstrained optimization depend upon updating the Hessian approximation by a formula which depends on two parameters (say, τ and θ) such that τ = 1, θ = 0, and θ = 1 yield the unscaled Broyden family, the BFGS update, and the DFP update, respectively. In previous work, conditions were obtained on these parameters that imply global and superlinear convergence for self-scaling methods on convex objective functions. This paper discusses the practical performance of several new algorithms designed to satisfy these conditions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Oren, S. S., and Luenberger, D. G., Self-Scaling Variable Metric (SSVM) Algorithms, I: Criteria and Sufficient Conditions for Scaling a Class of Algorithms, Management Science, Vol. 20, pp. 845–862, 1974.

    Google Scholar 

  2. Fletcher, R., Practical Methods of Optimization, 2nd Edition, Wiley, Chichester, England, 1987.

    Google Scholar 

  3. Powell, M. J. D., Some Global Convergence Properties of a Variable Metric Algorithm for Minimization without Exact Line Searches, Nonlinear Programming, Edited by R. W. Cottle and C. E. Lemke, SIAM Publications, Philadelphia, Pennsylvania, Vol. 9, pp. 53–72, 1976.

    Google Scholar 

  4. Zhang, Y., and Tewarson, R. P., Quasi-Newton Algorithms with Updates from the Preconvex Part of Broyden's Family, IMA Journal of Numerical Analysis, Vol. 8, pp. 487–509, 1988.

    Google Scholar 

  5. Byrd, R., Nocedal, J., and Juan, Y., Global Convergence of a Class of Quasi-Newton Methods on Convex Problems, SIAM Journal on Numerical Analysis, Vol. 24, pp. 1171–1190, 1987.

    Google Scholar 

  6. Byrd, R., Liu, D., and Nocedal, J., On the Behavior of Broyden's Class of Quasi-Newton Methods, SIAM Journal on Optimization, Vol. 2, pp. 533–557, 1992.

    Google Scholar 

  7. Al-Baali, M., Global and Superlinear Convergence of a Class of Self-Scaling Methods with Inexact Line Searches, Computational Optimization and Applications, Vol. 9, 1998.

  8. Nocedal, J., and Yuan, Y., Analysis of a Self-Scaling Quasi-Newton Method, Mathematical Programming, Vol. 61, pp. 19–37, 1993.

    Google Scholar 

  9. Carter, R., Safeguarding Hessian Approximations in Trust Region Algorithms, Report TR87-12, Department of Mathematical Sciences, Rice University, 1987.

  10. Contreras, M., and Tapia, R. A., Sizing the BFGS and DFP Updates: A Numerical Study, Journal of Optimization Theory and Applications, Vol. 78, pp. 93–108, 1993.

    Google Scholar 

  11. Luksăn, L., Computational Experience with Known Variable Metric Updates, Journal of Optimization Theory and Applications, Vol. 83, pp. 27–47, 1994.

    Google Scholar 

  12. Wolkowicz, H., and Zhao, Q., An All-Inclusive Efficient Region of Updates for Least Change Secant Methods, SIAM Journal on Optimization, Vol. 5, pp. 172–191, 1995.

    Google Scholar 

  13. Oren, S. S., and Spedicato, E., Optimal Conditioning of Self-Scaling Variable Metric Algorithms, Mathematical Programming, Vol. 10, pp. 70–90, 1976.

    Google Scholar 

  14. Liu, D. C., and Nocedal, J., On the Limited Memory BFGS Method for Large Scale Optimization, Mathematical Programming, Vol. 45, pp. 503–528, 1989.

    Google Scholar 

  15. Al-Baali, M., Analysis of a Family of Self-Scaling Quasi-Newton Methods, Technical Report, Department of Mathematics and Computer Science, United Arab Emirates University, 1993.

  16. Siegel, D., Modifying the BFGS Update by a New Column Scaling Technique, Mathematical Programming, Vol. 45, pp. 45–78, 1993.

    Google Scholar 

  17. Al-Baali, M., On the Self-Scaling Updating Formulae for Quasi-Newton Methods, Report 87, Department of Systems, University of Calabria, 1990.

  18. Hu, Y. F., and Storey, C., On Optimally and Near-Optimally Conditioned Quasi-Newton Updates, Report A141, Department of Mathematics, University of Loughborough, 1991.

  19. Al-Baali, M., An Efficient Class of Switching Type Algorithms in the Broyden Family, Optimization Methods and Software, Vol. 4, pp. 29–46, 1994.

    Google Scholar 

  20. Shanno, D. F., and Phua, K. H., Matrix Conditioning and Nonlinear Optimization, Mathematical Programming, Vol. 14, pp. 149–160, 1978.

    Google Scholar 

  21. Bongartz, I., Conn, A. R., Gould, N., and Toint, P. L., CUTE: Constrained and Unconstrained Testing Environment, Unpublished Manuscript, 1993.

  22. MorÉ, J. J., Garbow, B. S., and Hillstrom, K. E., Testing Unconstrained Optimization Software, ACM Transactions on Mathematical Software, Vol. 7, pp. 17–41, 1981.

    Google Scholar 

  23. Al-Baali, M., and Khalfan, H. F., Experimental Study of Globally and Superlinearly Convergent Self-Scaling Quasi-Newton Methods, Technical Report, Department of Mathematics and Computer Science, United Arab Emirates University, 1996.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Al-Baali, M. Numerical Experience with a Class of Self-Scaling Quasi-Newton Algorithms. Journal of Optimization Theory and Applications 96, 533–553 (1998). https://doi.org/10.1023/A:1022608410710

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022608410710

Navigation