Abstract
In this note least squares problems with certain convex restraints are solved without the use of linear programming. The solution involves solving the normal equations for a number of unrestricted problems.

This publication has 0 references indexed in Scilit: