AbstractThis paper will consider the problem of solving the nonlinear system of equations with block-triangular structure. A generalized block Newton method for semismooth sparse system is presented and a locally superlinear convergence is proved. Moreover, locally linear convergence of some parameterized Newton method is shown
We develop general approximate Newton methods for solving Lipschitz continuous equations by replacin...
The preconditioned generalized shift-splitting (PGSS) iteration method is unconditionally convergent...
AbstractWe develop and analyze an affine scaling inexact generalized Newton algorithm in association...
AbstractThis paper will consider the problem of solving the nonlinear system of equations with block...
Systems of equations with block-angular structure have applications in evolution problems coming fro...
AbstractSystems of equations with block-angular structure have applications in evolution problems co...
A nonlinear system of equations is said to be reducible if it can be divided into m blocks (m>1) in ...
In this paper we present a Quasi-Newton type method, which applies to large and sparse nonlinear sys...
A nonlinear system of equations is said to be reducible if it can be divided into m blocks (m > 1) i...
In this paper, we present the results obtained by solving consistent sparse systems of n nonlinear e...
For mildly nonlinear systems, involving concave diagonal nonlinearities, semi-global monotone conver...
In this paper, we consider the problem of finding a convex function which interpolates given points ...
Abstract. This paper generalizes to the nonlinear case a standard way to solve general sparse system...
AbstractThis paper investigates inexact Newton methods for solving systems of nonsmooth equations. W...
This paper presents some globally convergent descent methods for solving systems of nonlinear equati...
We develop general approximate Newton methods for solving Lipschitz continuous equations by replacin...
The preconditioned generalized shift-splitting (PGSS) iteration method is unconditionally convergent...
AbstractWe develop and analyze an affine scaling inexact generalized Newton algorithm in association...
AbstractThis paper will consider the problem of solving the nonlinear system of equations with block...
Systems of equations with block-angular structure have applications in evolution problems coming fro...
AbstractSystems of equations with block-angular structure have applications in evolution problems co...
A nonlinear system of equations is said to be reducible if it can be divided into m blocks (m>1) in ...
In this paper we present a Quasi-Newton type method, which applies to large and sparse nonlinear sys...
A nonlinear system of equations is said to be reducible if it can be divided into m blocks (m > 1) i...
In this paper, we present the results obtained by solving consistent sparse systems of n nonlinear e...
For mildly nonlinear systems, involving concave diagonal nonlinearities, semi-global monotone conver...
In this paper, we consider the problem of finding a convex function which interpolates given points ...
Abstract. This paper generalizes to the nonlinear case a standard way to solve general sparse system...
AbstractThis paper investigates inexact Newton methods for solving systems of nonsmooth equations. W...
This paper presents some globally convergent descent methods for solving systems of nonlinear equati...
We develop general approximate Newton methods for solving Lipschitz continuous equations by replacin...
The preconditioned generalized shift-splitting (PGSS) iteration method is unconditionally convergent...
AbstractWe develop and analyze an affine scaling inexact generalized Newton algorithm in association...
DOI
Add to ORKG