A branch and bound algorithm for constrained least squares
Adele Cutler · Communications in Statistics - Simulation and Computation · 1993
A new branch and bound algorithm is described for solving non-negative least squares problems. The method is extended to the case where a single equality constraint must also be satisfied. Simulations suggest that the new algorithm is considerably faster than several alternative methods, especially when most of the parameter estimates are strictly positive at the solution.