Skip to main content
SpringerLink
Log in

Trust region dogleg path algorithms for unconstrained minimization

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

In this paper, we propose a class of convenient curvilinear search algorithms to solve trust region problems arising from unconstrained optimization. The curvilinear paths we set are dogleg paths, generated mainly by employing Bunch‐Parlett factorization for general symmetric matrices which may be indefinite. These algorithms are easy to use and globally convergent. It is proved that these algorithms satisfy the first‐ and second‐order stationary point convergence properties and that the convergence rate is quadratic under commonly used conditions.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J.P. Bulteau and J.Ph. Vial, Unconstrained optimization by approximation of a projected gradient path, Research Report 8352, Center for Operations Research and Econometrics, Université Catholique de Louvain, Belgium, 1983.

    Google Scholar 

  2. J.P. Bulteau and J.Ph. Vial, A restricted trust region algorithm for unconstrained optimization, Journal of Optimization Theory and Applications 47(1985)413-434.

    Article  Google Scholar 

  3. J.P. Bulteau and J.Ph. Vial, Curvilinear path and trust region in unconstrained optimization: A convergence analysis, Mathematical Programming Study 30(1987)82-101.

    Google Scholar 

  4. J.R. Bunch and B.N. Parlett, Direct method for solving symmetric indefinite systems of linear equations, SIAM Journal on Numerical Analysis 8(1971) 639-655.

    Article  Google Scholar 

  5. J.R. Bunch, L. Kaufman and B.N. Parlett, Decomposition of a symmetric matrix, Numerische Mathematik 27(1976)95-109.

    Article  Google Scholar 

  6. R.H. Byrd, R.B. Schnabel and G.A. Shultz, Approximate solution of the trust region problem by minimization over two-dimensional subspaces, Mathematical Programming 40(1988) 247-263.

    Article  Google Scholar 

  7. J.E. Dennis and H.H.W Mei, Two new unconstrained optimization algorithms which use function and gradient values, Journal of Optimization Theory and Applications 28(1979)453-482.

    Article  Google Scholar 

  8. J.J. Moré, B.S. Garbow and K.E. Hillstrom, Testing unconstrained optimization software, ACM Transactions on Mathematical Software 7(1981)17-41.

    Article  Google Scholar 

  9. S.G. Nash, Newton-type minimization via the Lanczos method, SIAM J. on Numerical Analysis 21(1984)770-788.

    Article  Google Scholar 

  10. M.J.D. Powell, A hybrid method for nonlinear equations, in: Numerical Methods for Nonlinear Algebraic Equations, ed. Ph. Rabinowitz, Gordon and Breach, 1970, pp. 87-114.

  11. G.A. Shultz, R.B. Schnabel and R.H. Byrd, A family of trust-region-based algorithms for unconstrained minimization with strong global convergence properties, SIAM Journal on Numerical Analysis 22(1985)47-67.

    Article  Google Scholar 

  12. J.-Z. Zhang and C.-X. Xu, A class of indefinite dogleg path methods for unconstrained minimization, Research Report MA-94-09, City University of Hong Kong, Hong Kong, 1994.

    Google Scholar 

Download references

Authors
  1. J.-Z. Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C.-X. Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, JZ., Xu, CX. Trust region dogleg path algorithms for unconstrained minimization. Annals of Operations Research 87, 407–418 (1999). https://doi.org/10.1023/A:1018957708498

Download citation

  • Issue Date:

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

Keywords

Search

Navigation