Bvls.f solves least-squares problems with bounds on the variables. Qr.f computes QR decompositions in a stable way. Sbl1.f finds bounds on linear functionals of an n-vector subject to an l1 constraint on the misfit to a set of linear relations, and linear