Bounded-variable least-squares: an algorithm and applications The bounded-variable least-squares algorithm (BVLS) which solves linear least-squares problems with upper and lower bounds on the variables is described. BVLS is used also to find bounds for linear functionals of a model constrained to satisfy, in approximate l p -norm sense, a set of linear equality constraints in addition to upper and lower bounds. It is shown how to use BVLS to solve that problem when p=1,2 or ∞, and to solve minimum l 1 and l ∞ fitting problems. A variety of applications of BVLS is described and such features of this algorithm as numerical stability and computational efficiency are emphasized. The BVLS algorithm is implemented as a Fortran subroutine and is available from the statlib gopher at Carnegie Mellon University.
Keywords for this software
References in zbMATH (referenced in 4 articles )
Showing results 1 to 4 of 4.
- Mead, Jodi L.; Renaut, Rosemary A.: Least squares problems with inequality constraints as quadratic constraints (2010)
- Li, Lei M.: An algorithm for computing exact least-trimmed squares estimate of simple linear regression with constraints (2005)
- Li, Lei; Speed, Terence P.: Parametric deconvolution of positive spike trains. (2000)
- Stark, P. B.; Parker, R. L.: Bounded-variable least-squares: an algorithm and applications (1995)