A geometric property of the least squares solution of linear equations

AbstractWe derive an explicit determinantal formula for the least squares solution of an overdetermined system of linear equations. From this formula it follows that the least squares solution lies in the convex hull of the solutions to the square subsystems of the original system. We extend this result and prove that this geometric property holds for a more general class of problems which includes the weighted least squares and lp-norm minimization problems