Han-type algorithms for inconsistent systems of linear inequalities – A unified approach

In this paper we propose a unification approach for a class of Han-type algorithms for approximating least squares solutions of inconsistent systems of linear inequalities. Regarding this aspect we establish two basic assumptions and we prove that all the Han-type algorithms fulfill them, which give us the possibility to obtain certain convergence results. Numerical experiments on two sets of linear separability problems are also presented.