Tsnnls: A solver for large sparse least squares problems with non-negative variables

Simple item page
dc.creatorCantarella, Jason
dc.creatorPiatek, Michael
dc.date2004-08-13
dc.date.accessioned2026-07-07T03:21:39Z
dc.date.available2026-07-07T03:21:39Z
dc.descriptionThe 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.
dc.description7 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/cs/0408029
dc.identifierhttp://arxiv.org/abs/cs/0408029
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32286
dc.subjectMathematical Software
dc.subjectG. 1 3
dc.titleTsnnls: A solver for large sparse least squares problems with non-negative variables
dc.typetext

Files

Collections

arXiv