On the Convergence of a Quasi-Newton Method for Sparse Nonlinear Systems

DOI10.2307/2006157zbMath0385.65027OpenAlexW4240895030MaRDI QIDQ4166139

Binh Lam

Publication date: 1978

Full work available at URL: https://doi.org/10.2307/2006157

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical computation of solutions to systems of equations (65H10)

Related Items

Modified Newton-PBS method for solving a class of complex symmetric nonlinear systems ⋮ A two-step matrix-free secant method for solving large-scale systems of nonlinear equations ⋮ Global convergence of Schubert's method for solving sparse nonlinear equations ⋮ A matrix-free quasi-Newton method for solving large-scale nonlinear systems ⋮ Partitioned quasi-Newton methods for sparse nonlinear equations ⋮ MN-PGSOR method for solving nonlinear systems with block two-by-two complex symmetric Jacobian matrices

Cites Work

• Unnamed Item
• On the Local and Superlinear Convergence of Quasi-Newton Methods
• A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
• A Class of Methods for Solving Nonlinear Simultaneous Equations
• Modification of a Quasi-Newton Method for Nonlinear Equations with a Sparse Jacobian
• The Convergence of Single-Rank Quasi-Newton Methods
• The Convergence of an Algorithm for Solving Sparse Nonlinear Systems