New iterative methods for solving systems of linear inequalities are presented. Each step in these methods consists of finding the orthogonal projection of the current point onto a hyperplane corresponding to a surrogate constraint which is constructed through a positive combination of a group of violated constraints. Both sequential and parallel implementations are discussed.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/45240/1/10957_2004_Article_BF00939954.pd
AbstractAn iterative method is proposed for solving convex feasibility problems. Each iteration is a...
International audienceThe effectiveness of projection methods for solving systems of linear inequali...
AbstractA unified framework is presented for studying the convergence of projection methods for find...
In this study we consider the problem of finding a feasible solution $\rm\bar x \in \IR\sp{n}$ to a ...
Cataloged from PDF version of article.When formulated as a system of linear inequalities, the image ...
When formulated as a system of linear inequalities, the image restoration problem yields huge, unstr...
AbstractThe relaxation method for linear inequalities iterates by projecting the current point onto ...
AbstractA unified framework is presented for studying the convergence of projection methods for find...
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...
Many optimization problems reduce to the solution of a system of lin-ear inequalities (SLI). Some so...
AbstractAn iterative method for solving general systems of linear inequalities is considered. The me...
AbstractAn iterative method is proposed for solving convex feasibility problems. Each iteration is a...
Abstract Based on a new efficient identification technique of active constraints introduced in this ...
We consider linear feasibility problems in the "standard" form Ax = b, 1 ≤ x ≤ u. The successive ort...
AbstractAn iterative method is proposed for solving convex feasibility problems. Each iteration is a...
International audienceThe effectiveness of projection methods for solving systems of linear inequali...
AbstractA unified framework is presented for studying the convergence of projection methods for find...
In this study we consider the problem of finding a feasible solution $\rm\bar x \in \IR\sp{n}$ to a ...
Cataloged from PDF version of article.When formulated as a system of linear inequalities, the image ...
When formulated as a system of linear inequalities, the image restoration problem yields huge, unstr...
AbstractThe relaxation method for linear inequalities iterates by projecting the current point onto ...
AbstractA unified framework is presented for studying the convergence of projection methods for find...
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...
Many optimization problems reduce to the solution of a system of lin-ear inequalities (SLI). Some so...
AbstractAn iterative method for solving general systems of linear inequalities is considered. The me...
AbstractAn iterative method is proposed for solving convex feasibility problems. Each iteration is a...
Abstract Based on a new efficient identification technique of active constraints introduced in this ...
We consider linear feasibility problems in the "standard" form Ax = b, 1 ≤ x ≤ u. The successive ort...
AbstractAn iterative method is proposed for solving convex feasibility problems. Each iteration is a...
International audienceThe effectiveness of projection methods for solving systems of linear inequali...
AbstractA unified framework is presented for studying the convergence of projection methods for find...