Skip to main content
Log in

Convergence Rate of the Pham Dinh–Le Thi Algorithm for the Trust-Region Subproblem

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

Abstract

We obtain sufficient conditions for the linear convergence of the iterative sequences produced by the Pham Dinh–Le Thi algorithm for the trust-region subproblem. In addition, we give two examples to show that, if the sufficient conditions are not satisfied, then the sequences may not be linearly convergent.

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. Conn, A.R., Gould, N.I.M., Toint, P.L.: In: Trust-Region Methods. MPS-SIAM Series on Optimization. SIAM, Philadelphia (2000)

    Chapter  Google Scholar 

  2. Pham Dinh, T., Le Thi, H.A.: Convex analysis approach to D.C. programming: theory, algorithms and applications. Acta Math. Vietnam. 22, 289–355 (1997)

    MathSciNet  MATH  Google Scholar 

  3. Pham Dinh, T., Le Thi, H.A.: A D.C. optimization algorithm for solving the trust-region subproblem. SIAM J. Optim. 8, 476–505 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  4. Le Thi, H.A., Pham Dinh, T., Yen, N.D.: Behavior of DCA sequences for solving the trust-region subproblem. J. Glob. Optim. (2010). Online First. doi:10.1007/s10898-011-9696-z

    Google Scholar 

  5. Tuan, H.N., Yen, N.D.: Convergence of Pham Dinh–Le Thi algorithm for the trust-region subproblem. J. Glob. Optim. (2011). Online First. doi:10.1007/s10898-011-9820-0

    Google Scholar 

  6. Martinez, J.M.: Local minimizers of quadratic functions on Euclidean balls and spheres. SIAM J. Optim. 4, 159–176 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  7. Pham Dinh, T., Le Thi, H.A.: Lagrangian stability and global optimality on nonconvex quadratic minimization over Euclidean balls and spheres. J. Convex Anal. 2, 263–276 (1995)

    MathSciNet  MATH  Google Scholar 

  8. Pardalos, P.M., Resende, M.G.C.: Handbook of Applied Optimization. Oxford University Press, New York (2002)

    MATH  Google Scholar 

  9. Stoer, J., Burlish, R.: Introduction to Numerical Analysis, 3rd edn. Springer, New York (2002)

    MATH  Google Scholar 

Download references

Acknowledgements

This research was supported by the National Foundation for Science and Technology Development (NAFOSTED) of Vietnam. The author would like to thank Professor Nguyen Dong Yen for fruitful discussions on the topic, the two anonymous referees, and Professor Masao Fukushima for valuable comments, which have helped to improve greatly the presentation.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hoang Ngoc Tuan.

Additional information

Communicated by Masao Fukushima.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ngoc Tuan, H. Convergence Rate of the Pham Dinh–Le Thi Algorithm for the Trust-Region Subproblem. J Optim Theory Appl 154, 904–915 (2012). https://doi.org/10.1007/s10957-012-0041-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-012-0041-6

Keywords

Navigation