Bertsekas (1976) On the Goldstein-Levitin-Polyak gradient projection method. IEEE Transactions on Automatic Control 21:174-184.
Bertsekas Constrained Optimization and Lagrange Multiplier Methods, Academic, New York; 1982.
Björck (1988) A direct method for sparse least squares problems with lower and upper bounds. Numer. Math. 54:19-32.
Björck (1989) Least squares methods. Handbook of Numerical Analysis , P.G. Ciarlet, J.L. Lions, Elsevier North-Holland; 1.
Clark, Osborne On Restricted and Interval Least Squares Problems, Dept. of Statistics, Australian National Univ, Canberra; 1986.
Conn, Gould, Toint (1988) Global convergence of a class of trust region algorithms for optimization with simple bounds. SIAM Journal on Numerical Analysis 25:433-460.
Conn, Gould, Toint (1988) Correction. SIAM Journal on Numerical Analysis , to appear.; 25:433-460.
Conn, Gould, Toint (1988) Testing a class of methods for solving minimization problems with simple bounds on the variables. Mathematics of Computation 50(182):399-430.
Dembo, Eisenstat, Steihaug (1982) Inexact Newton methods. SIAM Journal on Numerical Analysis 19(2):400-408.
Dembo, Tulowitski (1984) On the Minimization of Quadratic Functions Subject to Box Constraints. Technical Report, Dept. of Computer Science, Yale Univ; .
Dunn (1981) Global and asymptotic convergence rate estimates for a class of projected gradient process. SIAM Journal on Control and Optimization 19:368-400.
Gill, Murray, Wright Practical Optimization, Academic, New York; 1981.
Goldstein (1964) Convex programming in Hilbert space. Bulletin of the American Mathematical Society 70:709-710.
Golub, Manneback, Toint (1986) A comparison between some direct and iterative methods for large scale geodetic least squares problems. SIAM Journal on Scientific and Statistical Computing 7(3):799-816.
Hanson (1986) Linear least squares with bounds and linear constraints. SIAM Journal on Scientific and Statistical Computing 7:826-834.
Heath (1984) Numerical methods for large linear least squares problems. SIAM Journal on Scientific and Statistical Computing 5:497-513.
Hestenes, Stiefel (1952) Methods of conjugate gradients for solving linear systems. Journal of Research of the National Bureau of Standards 49:409-436.
Levitin, Polyak (1966) Constrained minimization problems. U.S.S.R. Comput. Math. and Math. Phys. 6:1-50.
Lötstedt (1984) Solving the minimal least squares problem subject to bounds on the variables. BIT 24:206-224.
Lötstedt (1984) Numerical simulation of time-dependent contact and friction problems in rigid body mechanics. SIAM Journal on Scientific and Statistical Computing 5:370-393.
O'Leary (1980) A generalized conjugate gradient algorithm for solving a class of quadratic programming problems. Linear Algebra Appl. 34:371-399.
Oreborn (1986) A Direct Method for Sparse Nonnegative Least Squares Problems. Thesis 87, Dept. of Mathematics, Linköping Univ, Linköping, Sweden; .
Paige, Saunders (1982) LSQR An algorithm for sparse linear equations and sparse least squares. ACM Transactions on Mathematical Software 8:43-71.
Toint (1981) Towards an efficient sparsity exploiting Newton method for minimization. Sparse Matrices and Their Uses, I.S. Duff, Academic, London; .
Toint (1988) Global convergence of a class of trust region methods for nonconvex minimization in Hilbert space. IMA J. Numer. Anal. 8:231-252.
Vardi, Shepp, Kaufman (1983) A statistical model for positron emission tomography. Working Paper, Bell Labs, Murray Hill, N.J; .
Yang, Tolle A class of methods for solving large convex quadratic programs subject to box constraints, private communication; 1989.
Zimmermann (1977) Ein Algorithmus zur Lösung linearer Least Squares Probleme mit unteren und oberen Schranken als Nebenbedingungen. Diplomarbeit, Inst. fün Angewandte Mathematik, Univ. Würzburg, Germany; .
