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 consider a class of extended relaxation methods depending on a parameter and prove their convergence. Numerical experiments have been provided, as well
We combine two iterative algorithms for solving large-scale systems of linear inequalities, the rela...
We focus on convex semi-infinite programs with an infinite number of quadratically parametrized cons...
International audienceWe focus on convex semi-infinite programs with an infinite number of quadratic...
The problem of finding a feasible solution to a linear inequality system arises in numerous contexts...
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...
AbstractThe relaxation method for linear inequalities iterates by projecting the current point onto ...
AbstractThe iterative method of Cimmino for solving linear equations is generalized to linear inequa...
AbstractAn algorithm previously introduced by the author for finding a feasible point of a system of...
summary:In this paper an attempt is made to present a sudfficient general analysis of the convergenc...
A classical theorem by Block and Levin (Block, H. D., S. A. Levin. 1970. On the boundedness of an it...
In this study we consider the problem of finding a feasible solution $\rm\bar x \in \IR\sp{n}$ to a ...
AbstractAn algorithm is described for finding a feasible point for a system of linear inequalities. ...
This paper is intended to characterize three types of best approximate solutions for inconsistent li...
We combine two iterative algorithms for solving large-scale systems of linear inequalities, the rela...
We focus on convex semi-infinite programs with an infinite number of quadratically parametrized cons...
International audienceWe focus on convex semi-infinite programs with an infinite number of quadratic...
The problem of finding a feasible solution to a linear inequality system arises in numerous contexts...
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...
AbstractThe relaxation method for linear inequalities iterates by projecting the current point onto ...
AbstractThe iterative method of Cimmino for solving linear equations is generalized to linear inequa...
AbstractAn algorithm previously introduced by the author for finding a feasible point of a system of...
summary:In this paper an attempt is made to present a sudfficient general analysis of the convergenc...
A classical theorem by Block and Levin (Block, H. D., S. A. Levin. 1970. On the boundedness of an it...
In this study we consider the problem of finding a feasible solution $\rm\bar x \in \IR\sp{n}$ to a ...
AbstractAn algorithm is described for finding a feasible point for a system of linear inequalities. ...
This paper is intended to characterize three types of best approximate solutions for inconsistent li...
We combine two iterative algorithms for solving large-scale systems of linear inequalities, the rela...
We focus on convex semi-infinite programs with an infinite number of quadratically parametrized cons...
International audienceWe focus on convex semi-infinite programs with an infinite number of quadratic...