Global convergence of Schubert's method for solving sparse nonlinear equations
Summary: 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 and \(q\)-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.
- Comparing Algorithms for Solving Sparse Nonlinear Systems of Equations
- A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
- scientific article; zbMATH DE number 943427
- On the solution of highly structured nonlinear equations
- A globally convergent Newton-GMRES method for large sparse systems of nonlinear equations
- A Class of Methods for Solving Nonlinear Simultaneous Equations
- A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
- A nonmonotone hybrid method for nonlinear systems∗
- An Efficient Implementation of Merrill’s Method for Sparse or Partially Separable Systems of Nonlinear Equations
- An Optimal Positive Definite Update for Sparse Hessian Matrices
- Analysis of sparse quasi-Newton updates with positive definite matrix completion
- Comparing Algorithms for Solving Sparse Nonlinear Systems of Equations
- Convergence Results for Schubert’s Method for Solving Sparse Nonlinear Equations
- Global convergence of the partitioned BFGS algorithm for convex partially separable optimization
- Modification of a Quasi-Newton Method for Nonlinear Equations with a Sparse Jacobian
- On Sparse and Symmetric Matrix Updating Subject to a Linear Equation
- On the Convergence of a Quasi-Newton Method for Sparse Nonlinear Systems
- On Variable-Metric Methods for Sparse Hessians
- Recent advances in numerical methods for nonlinear equations and nonlinear least squares
- Solving nonlinear systems of equations by means of quasi-neston methods with a nonmonotone stratgy∗
- Sparse quasi-Newton updates with positive definite matrix completion
- Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
- Testing Unconstrained Optimization Software
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- The Convergence of an Algorithm for Solving Sparse Nonlinear Systems
- The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
- The “global” convergence of Broyden-like methods with suitable line search
- Verallgemeinertem-Punkt-Sekantenverfahren für schwach besetzte nichtlineare Gleichungssysteme
- Multiple Schubert’s updating matrix and its compact representation
- scientific article; zbMATH DE number 943427 (Why is no real title available?)
- A derivative-free Levenberg-Marquardt method for sparse nonlinear least squares problems
This page was built for publication: Global convergence of Schubert's method for solving sparse nonlinear equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1722445)
