Tsnnls: A solver for large sparse least squares problems with non-negative variables
<|reference_start|>Tsnnls: A solver for large sparse least squares problems with non-negative variables: The solution of large, sparse constrained least-squares problems is a staple in scientific and engineering applications. However, currently available codes for such problems are proprietary or based on MATLAB. We announce a freely available C implementation of the fast block pivoting algorithm of Portugal, Judice, and Vicente. Our version is several times faster than Matstoms' MATLAB implementation of the same algorithm. Further, our code matches the accuracy of MATLAB's built-in lsqnonneg function.<|reference_end|>
@article{cantarella2004tsnnls:,
    title={Tsnnls: A solver for large sparse least squares problems with
  non-negative variables},
    author={Jason Cantarella and Michael Piatek},
    journal={arXiv preprint arXiv:cs/0408029},
    year={2004},
    archivePrefix={arXiv},
    eprint={cs/0408029},
    primaryClass={cs.MS}
}