Key points are not available for this paper at this time.
This article presents a numerically stable algorithm for solving linear least-squares problems with linear equalities and inequalities as additional constraints. The method proposed is a method of feasible directions and is related to Rosen’s gradient projection method. Moreover, together with a discussion of possible extensions a simplified version of the basic algorithm for solving linear programming problems is described.
Josef Stoer (Tue,) studied this question.