IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v157y2008i1p193-20510.1007-s10479-007-0196-y.html
   My bibliography  Save this article

A globally convergent inexact Newton method with a new choice for the forcing term

Author

Listed:
  • Márcia Gomes-Ruggiero
  • Véra Lopes
  • Julia Toledo-Benavides

Abstract

In inexact Newton methods for solving nonlinear systems of equations, an approximation to the step s k of the Newton’s system J(x k )s=−F(x k ) is found. This means that s k must satisfy a condition like ‖F(x k )+J(x k )s k ‖≤η k ‖F(x k )‖ for a forcing term η k ∈[0,1). Possible choices for η k have already been presented. In this work, a new choice for η k is proposed. The method is globalized using a robust backtracking strategy proposed by Birgin et al. (Numerical Algorithms 32:249–260, 2003 ), and its convergence properties are proved. Several numerical experiments with boundary value problems are presented. The numerical performance of the proposed algorithm is analyzed by the performance profile tool proposed by Dolan and Moré (Mathematical Programming Series A 91:201–213, 2002 ). The results obtained show a competitive inexact Newton method for solving academic and applied problems in several areas. Copyright Springer Science+Business Media, LLC 2008

Suggested Citation

  • Márcia Gomes-Ruggiero & Véra Lopes & Julia Toledo-Benavides, 2008. "A globally convergent inexact Newton method with a new choice for the forcing term," Annals of Operations Research, Springer, vol. 157(1), pages 193-205, January.
    • Handle: RePEc:spr:annopr:v:157:y:2008:i:1:p:193-205:10.1007/s10479-007-0196-y
    DOI: 10.1007/s10479-007-0196-y
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-007-0196-y
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-007-0196-y?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. Abdolreza Amiri & Mohammad Taghi Darvishi & Alicia Cordero & Juan Ramón Torregrosa, 2019. "An Efficient Iterative Method Based on Two-Stage Splitting Methods to Solve Weakly Nonlinear Systems," Mathematics, MDPI, vol. 7(9), pages 1-17, September.

    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:annopr:v:157:y:2008:i:1:p:193-205:10.1007/s10479-007-0196-y. 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.