Global Convergence of Schubert’s Method for Solving Sparse Nonlinear Equations
Author:
Open Access
- 14 October 2014
- journal article
- research article
- Published by Wiley in Abstract and Applied Analysis
- Vol. 2014, 1-12
Abstract
Schubert’s method is an extension of Broyden’s method for solving sparse nonlinear equations, which can preserve the zero-nonzero structure defined by the sparse Jacobian matrix and can retain many good properties of Broyden’s method. In particular, Schubert’s method has been proved to be locally andq-superlinearly convergent. In this paper, we globalize Schubert’s method by using a nonmonotone line search. Under appropriate conditions, we show that the proposed algorithm converges globally and superlinearly. Some preliminary numerical experiments are presented, which demonstrate that our algorithm is effective for large-scale problems.Keywords
Funding Information
- National Natural Science Foundation of China (11371154)
This publication has 22 references indexed in Scilit:
- Analysis of Sparse Quasi-Newton Updates with Positive Definite Matrix CompletionJournal of the Operations Research Society of China, 2014
- Recent advances in numerical methods for nonlinear equations and nonlinear least squaresNumerical Algebra, Control & Optimization, 2011
- Sparse quasi-Newton updates with positive definite matrix completionMathematical Programming, 2007
- An Optimal Positive Definite Update for Sparse Hessian MatricesSIAM Journal on Optimization, 1995
- On Variable-Metric Methods for Sparse HessiansMathematics of Computation, 1980
- Convergence Results for Schubert’s Method for Solving Sparse Nonlinear EquationsSIAM Journal on Numerical Analysis, 1979
- On the convergence of a quasi-Newton method for sparse nonlinear systemsMathematics of Computation, 1978
- On sparse and symmetric matrix updating subject to a linear equationMathematics of Computation, 1977
- The convergence of an algorithm for solving sparse nonlinear systemsMathematics of Computation, 1971
- Modification of a quasi-Newton method for nonlinear equations with a sparse JacobianMathematics of Computation, 1970