summary:In this paper an attempt is made to present a sudfficient general analysis of the convergence of modified relaxation methods for certain nonlinear problems in finite dimensional spaces. Many important results that have already been attained for linear problems are included here as special cases
AbstractA new relaxed algorithmic procedure based on the notion of A-maximal relaxed monotonicity is...
AbstractA family of algorithms for nonlinear approximation is defined by point-to-setmaps. Then Zang...
AbstractA certain convergence notion for extended real-valued functions, which has been studied by a...
summary:In this paper an attempt is made to present a sudfficient general analysis of the convergenc...
The problem of finding a feasible solution to a linear inequality system arises in numerous contexts...
A general approach to constructing iterative methods that solve variational inequalities under mild ...
In this work we study the local and semilocal convergence of the relaxed Newton's method, that is Ne...
In this paper, we describe a class of combined relaxation methods for the non strictly monotone nonl...
The problem (LFP) of finding a feasible solution to a given linear semi-infinite system arises in d...
We consider a combined relaxation method for variational inequalities in a Hilbert space setting. Me...
When applied to variational inequalities, combined relaxation (CR) methods are convergent under mild...
AbstractMultisplitting methods are parallel methods for the solution of a linear system Ax = b. It h...
A classical theorem by Block and Levin (Block, H. D., S. A. Levin. 1970. On the boundedness of an it...
AbstractA new relaxed algorithmic procedure based on the notion of A-maximal relaxed monotonicity is...
AbstractA family of algorithms for nonlinear approximation is defined by point-to-setmaps. Then Zang...
AbstractA certain convergence notion for extended real-valued functions, which has been studied by a...
summary:In this paper an attempt is made to present a sudfficient general analysis of the convergenc...
The problem of finding a feasible solution to a linear inequality system arises in numerous contexts...
A general approach to constructing iterative methods that solve variational inequalities under mild ...
In this work we study the local and semilocal convergence of the relaxed Newton's method, that is Ne...
In this paper, we describe a class of combined relaxation methods for the non strictly monotone nonl...
The problem (LFP) of finding a feasible solution to a given linear semi-infinite system arises in d...
We consider a combined relaxation method for variational inequalities in a Hilbert space setting. Me...
When applied to variational inequalities, combined relaxation (CR) methods are convergent under mild...
AbstractMultisplitting methods are parallel methods for the solution of a linear system Ax = b. It h...
A classical theorem by Block and Levin (Block, H. D., S. A. Levin. 1970. On the boundedness of an it...
AbstractA new relaxed algorithmic procedure based on the notion of A-maximal relaxed monotonicity is...
AbstractA family of algorithms for nonlinear approximation is defined by point-to-setmaps. Then Zang...
AbstractA certain convergence notion for extended real-valued functions, which has been studied by a...
DOI
Add to ORKG