Abstract
Three algorithms are developed and validated for finding a pointx inR n that satisfies a given system of inequalities,Axb. A andb are a given matrix and a given vector inR mn andR m , respectively, with the rows ofA assumed normalized. The algorithms are iterative and are based upon the orthogonal projection of an infeasible point onto the manifold of the bounding hyperplanes of some of the given constraints. The choice of the active constraints and the actual projection are accomplished through the use of surrogate constraints.
Journal of Optimization Theory and Applications 01/1992; 72(2):247-268. DOI:10.1007/BF00940518
W A T
