Comparing Algorithms for Solving Sparse Nonlinear Systems of Equations
This paper presents a numerical comparison of eight algorithms: Newton's method, Broyden's first method, Schubert's method, the Dennis-Marwil method, and three methods of Martínez's family (the diagonal-scaling method, the row-scaling method and column-scaling method) as applied to solving large sparse nonlinear systems of equations. A survey of convergence results concerning these methods, of various stopping criteria and restarting criteria as well as strategies for singularity and step control is given. Aspects of global implementation of these methods are also examined. Finally, numerical experiments both with local and global algorithms are reported.
- A Hybrid Algorithm for Solving Sparse Nonlinear Systems of Equations
- An algorithm for solving sparse nonlinear least squares problems
- scientific article; zbMATH DE number 3901904
- A new computational method for the sparsest solutions to systems of linear equations
- A Comparison of Some Methods for Solving Sparse Linear Least-Squares Problems
- Sparse algorithms for indefinite system of linear equations
- scientific article; zbMATH DE number 3844929
- scientific article; zbMATH DE number 3874501
- Comparisons of two implementations for the solution of sparse linear systems - Part II
- Algorithms on the sparse solution of under-determined linear systems
- Quasi-Newton acceleration for equality-constrained minimization
- A hybrid of the Newton-GMRES and electromagnetic meta-heuristic methods for solving systems of nonlinear equations
- Successive column correction algorithms for solving sparse nonlinear systems of equations
- Parallel implementations of Broyden's method
- A parallel projection method for overdetermined nonlinear systems of equations
- Inexact trust region method for large sparse systems of nonlinear equations
- Solution of finite-dimensional variational inequalities using smooth optimization with simple bounds
- Quasi-Newton methods with derivatives
- Inverse \(q\)-columns updating methods for solving nonlinear systems of equations
- Practical quasi-Newton methods for solving nonlinear systems
- Global convergence of Schubert's method for solving sparse nonlinear equations
- A limited memory BFGS method for solving large-scale symmetric nonlinear equations
- A globalization procedure for solving nonlinear systems of equations
- A numerical study on large-scale nonlinear solvers
- Inexact overlapped block Broyden methods for solving nonlinear equations
- An extension of the theory of secant preconditioners
- Inexact Newton methods for solving nonsmooth equations
- Hybrid methods for large sparse nonlinear least squares
- Nonlinear Kaczmarz algorithms and their convergence
- A tensor trust-region model for nonlinear system
- Iterative reconstruction algorithms for solving the Schrödinger equations on conical spaces
- A Schrödinger-type algorithm for solving the Schrödinger equations via Phragmén-Lindelöf inequalities
- A genetic algorithm with a self-reproduction operator to solve systems of nonlinear equations
- Globally convergent diagonal Polak-Ribière-Polyak like algorithm for nonlinear equations
- Solvability for boundary value problem of the general Schrödinger equation with general superlinear nonlinearity
- Limited memory technique using trust regions for nonlinear equations
- A three-terms Polak-Ribière-Polyak conjugate gradient algorithm for large-scale nonlinear equations
- A multi-iterate method to solve systems of nonlinear equations
- Nonlinear analysis: optimization methods, convergence theory, and applications
- Corrigendum to: ``Krasnosel'skii type hybrid fixed point theorems and their applications to fractional integral equations
- Solvers for systems of nonlinear algebraic equations -- their sensitivity to starting vectors
- Newton-like method with modification of the right-hand-side vector
- Wei-Yao-Liu conjugate gradient projection algorithm for nonlinear monotone equations with convex constraints
- The Secant/Finite Difference Algorithm for Solving Sparse Nonlinear Systems of Equations
- Computational experience with globally convergent descent methods for large sparse systems of nonlinear equations∗
- Solving nonlinear systems of equations by means of quasi-neston methods with a nonmonotone stratgy∗
- A nonmonotone hybrid method for nonlinear systems∗
- scientific article; zbMATH DE number 1762799 (Why is no real title available?)
- Nonmonotone Spectral Methods for Large-Scale Nonlinear Systems
- A quasi-Newton algorithm for large-scale nonlinear equations
- A BFGS trust-region method with a new nonmonotone technique for nonlinear equations
- Barzilai-Borwein-like method for solving large-scale non-linear systems of equations
- A derivative-free projection algorithm for solving pseudo-monotone equations with convex constraints
- Inexact free derivative quasi-Newton method for large-scale nonlinear system of equations
- A fast inertial self-adaptive projection based algorithm for solving large-scale nonlinear monotone equations
- On maximum residual nonlinear Kaczmarz-type algorithms for large nonlinear systems of equations
- On pseudoinverse-free block maximum residual nonlinear Kaczmarz method for solving large-scale nonlinear system of equations
- A BFGS trust-region method for nonlinear equations
- Limited memory BFGS method with backtracking for symmetric nonlinear equations
- A class of pseudoinverse-free greedy block nonlinear Kaczmarz methods for nonlinear systems of equations
- A matrix-free quasi-Newton method for solving large-scale nonlinear systems
- On convergence of greedy block nonlinear Kaczmarz methods with momentum
- An accelerated derivative-free method for solving large-scale nonlinear non-monotone equations
- Nonmonotone quasi-Newton method with diagonal Jacobian approximation for symmetric nonlinear equations
- On averaged block nonlinear Kaczmarz method with adaptive step size for solving systems of nonlinear equations
- On the adaptively inexact sketched Newton-Raphson methods for nonlinear systems of equations
- A globally convergent inexact Newton method with a new choice for the forcing term
This page was built for publication: Comparing Algorithms for Solving Sparse Nonlinear Systems of Equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3991045)