IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v54y2013i1p27-43.html
   My bibliography  Save this article

Monotone and nonmonotone trust-region-based algorithms for large scale unconstrained optimization problems

Author

Listed:
  • María Maciel
  • María Mendonça
  • Adriana Verdiell

Abstract

Two trust regions algorithms for unconstrained nonlinear optimization problems are presented: a monotone and a nonmonotone one. Both of them solve the trust region subproblem by the spectral projected gradient (SPG) method proposed by Birgin, Martínez and Raydan (in SIAM J. Optim. 10(4):1196–1211, 2000 ). SPG is a nonmonotone projected gradient algorithm for solving large-scale convex-constrained optimization problems. It combines the classical projected gradient method with the spectral gradient choice of steplength and a nonmonotone line search strategy. The simplicity (only requires matrix-vector products, and one projection per iteration) and rapid convergence of this scheme fits nicely with globalization techniques based on the trust region philosophy, for large-scale problems. In the nonmonotone algorithm the trial step is evaluated by acceptance via a rule which can be considered a generalization of the well known fraction of Cauchy decrease condition and a generalization of the nonmonotone line search proposed by Grippo, Lampariello and Lucidi (in SIAM J. Numer. Anal. 23:707–716, 1986 ). Convergence properties and extensive numerical results are presented. Our results establish the robustness and efficiency of the new algorithms. Copyright Springer Science+Business Media, LLC 2013

Suggested Citation

  • María Maciel & María Mendonça & Adriana Verdiell, 2013. "Monotone and nonmonotone trust-region-based algorithms for large scale unconstrained optimization problems," Computational Optimization and Applications, Springer, vol. 54(1), pages 27-43, January.
    • Handle: RePEc:spr:coopap:v:54:y:2013:i:1:p:27-43
    DOI: 10.1007/s10589-012-9477-8
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-012-9477-8
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10589-012-9477-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    Citations

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


    Cited by:

    1. V. A. Ramirez & G. N. Sottosanto, 2022. "Nonmonotone trust region algorithm for solving the unconstrained multiobjective optimization problems," Computational Optimization and Applications, Springer, vol. 81(3), pages 769-788, April.

    Corrections

    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:54:y:2013:i:1:p:27-43. See general information about how to correct material in RePEc.

    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 bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.