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

DOI10.1007/s10479-007-0196-yzbMath1157.90556OpenAlexW2033283049MaRDI QIDQ940862

Véra Lucia Rocha Lopes, Julia Victoria Toledo-Benavides, Márcia Ap. Gomes-Ruggiero

Publication date: 3 September 2008

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-007-0196-y

zbMATH Keywords

line searchnonlinear systems of equations

Mathematics Subject Classification ID

Methods of quasi-Newton type (90C53)

Related Items

Semilocal and global convergence of the Newton-HSS method for systems of nonlinear equations

Uses Software

• NITSOL
• MINPACK-2
• KELLEY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A quasi-Newton method with modification of one column per iteration
• Globally convergent inexact quasi-Newton methods for solving nonlinear systems
• A numerical study on large-scale nonlinear solvers
• Hybrid Krylov Methods for Nonlinear Systems of Equations
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Inexact Newton Methods
• The column-updating method for solving nonlinear equations in Hilbert space
• Comparing Algorithms for Solving Sparse Nonlinear Systems of Equations
• Globally Convergent Inexact Newton Methods
• NITSOL: A Newton Iterative Solver for Nonlinear Systems
• Discrete Newton's method with local variations for solving large-scale nonlinear systems
• A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
• A Multigrid Tutorial, Second Edition
• On the Local and Superlinear Convergence of Quasi-Newton Methods
• Choosing the Forcing Terms in an Inexact Newton Method
• The Convergence of an Algorithm for Solving Sparse Nonlinear Systems
• Benchmarking optimization software with performance profiles.