The problem of finding a feasible solution to a linear inequality system arises in numerous contexts. In [12] an algorithm, called extended relaxation method, that solves the feasibility problem, has been proposed by the authors. Convergence of the algorithm has been proven. In this paper, we onsider a class of extended relaxation methods depending on a parameter and prove their convergence. Numerical experiments have been provided, as well
A simple iterative method for solving variational inequalities with a set-valued, nonmonotone mappin...
AbstractMultisplitting methods are parallel methods for the solution of a linear system Ax = b. It h...
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 classical theorem by Block and Levin (Block, H. D., S. A. Levin. 1970. On the boundedness of an it...
The problem (LFP) of finding a feasible solution to a given linear semi-infinite system arises in d...
AbstractThe problem of solving iteratively a large and possibly sparse system of interval linear ine...
In this paper, we describe a class of combined relaxation methods for the non strictly monotone nonl...
AbstractThe relaxation method for linear inequalities iterates by projecting the current point onto ...
AbstractAn algorithm is described for finding a feasible point for a system of linear inequalities. ...
The paper suggests an approach to characterizing global solutions for optimal control problems with ...
A general approach to constructing iterative methods that solve variational inequalities under mild ...
In this study we consider the problem of finding a feasible solution $\rm\bar x \in \IR\sp{n}$ to a ...
Title from cover.Bibliography: leaf [20].National Science Foundation Grant NSF-ECS-8217668.by Paul T...
The numerical solution of a possibly inconsistent system of linear inequalities in the ℓ1 sense is c...
A simple iterative method for solving variational inequalities with a set-valued, nonmonotone mappin...
AbstractMultisplitting methods are parallel methods for the solution of a linear system Ax = b. It h...
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 classical theorem by Block and Levin (Block, H. D., S. A. Levin. 1970. On the boundedness of an it...
The problem (LFP) of finding a feasible solution to a given linear semi-infinite system arises in d...
AbstractThe problem of solving iteratively a large and possibly sparse system of interval linear ine...
In this paper, we describe a class of combined relaxation methods for the non strictly monotone nonl...
AbstractThe relaxation method for linear inequalities iterates by projecting the current point onto ...
AbstractAn algorithm is described for finding a feasible point for a system of linear inequalities. ...
The paper suggests an approach to characterizing global solutions for optimal control problems with ...
A general approach to constructing iterative methods that solve variational inequalities under mild ...
In this study we consider the problem of finding a feasible solution $\rm\bar x \in \IR\sp{n}$ to a ...
Title from cover.Bibliography: leaf [20].National Science Foundation Grant NSF-ECS-8217668.by Paul T...
The numerical solution of a possibly inconsistent system of linear inequalities in the ℓ1 sense is c...
A simple iterative method for solving variational inequalities with a set-valued, nonmonotone mappin...
AbstractMultisplitting methods are parallel methods for the solution of a linear system Ax = b. It h...
summary:In this paper an attempt is made to present a sudfficient general analysis of the convergenc...