IDEAS home Printed from
   My bibliography  Save this article

On the convergence of trust region algorithms for unconstrained minimization without derivatives


  • M. Powell



We consider iterative trust region algorithms for the unconstrained minimization of an objective function $F ( \underline{x})$ , $\underline{x}\in \mathcal{R}^{n}$ , when F is differentiable but no derivatives are available, and when each model of F is a linear or a quadratic polynomial. The models interpolate F at n+1 points, which defines them uniquely when they are linear polynomials. In the quadratic case, second derivatives of the models are derived from information from previous iterations, but there are so few data that typically only the magnitudes of second derivative estimates are correct. Nevertheless, numerical results show that much faster convergence is achieved when quadratic models are employed instead of linear ones. Just one new value of F is calculated on each iteration. Changes to the variables are either trust region steps or are designed to maintain suitable volumes and diameters of the convex hulls of the interpolation points. It is proved that, if F is bounded below, if ∇ 2 F is also bounded, and if the number of iterations is infinite, then the sequence of gradients $\underline{\nabla}F ( \underline{x}_{\,k} )$ , k=1,2,3,…, converges to zero, where $\underline{x}_{\,k}$ is the centre of the trust region of the k-th iteration. Copyright Springer Science+Business Media, LLC 2012

Suggested Citation

  • M. Powell, 2012. "On the convergence of trust region algorithms for unconstrained minimization without derivatives," Computational Optimization and Applications, Springer, vol. 53(2), pages 527-555, October.
  • Handle: RePEc:spr:coopap:v:53:y:2012:i:2:p:527-555 DOI: 10.1007/s10589-012-9483-x

    Download full text from publisher

    File URL:
    Download Restriction: Access to full text is restricted to subscribers.

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    1. O. Ferreira & M. Gonçalves, 2011. "Local convergence analysis of inexact Newton-like methods under majorant condition," Computational Optimization and Applications, Springer, vol. 48(1), pages 1-21, January.
    Full references (including those not matched with items on IDEAS)


    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.

    Cited by:

    1. repec:spr:eurjco:v:5:y:2017:i:4:d:10.1007_s13675-017-0081-7 is not listed on IDEAS
    2. Adriano Verdério & Elizabeth W. Karas & Lucas G. Pedroso & Katya Scheinberg, 0. "On the construction of quadratic models for derivative-free trust-region algorithms," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 0, pages 1-27.
    3. Xiuhua Wang & Jisheng Kou, 2015. "Convergence analysis on a class of improved Chebyshev methods for nonlinear equations in Banach spaces," Computational Optimization and Applications, Springer, vol. 60(3), pages 697-717, April.


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:53:y:2012:i:2:p:527-555. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.