On iterative algorithms for linear least squares problems with bound constraints
- 1 January 1991
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 143, 111-143
- https://doi.org/10.1016/0024-3795(91)90009-l
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Algorithms for bound constrained quadratic programming problemsNumerische Mathematik, 1989
- Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert SpaceIMA Journal of Numerical Analysis, 1988
- Testing a class of methods for solving minimization problems with simple bounds on the variablesMathematics of Computation, 1988
- A Comparison Between Some Direct and Iterative Methods for Certain Large Scale Geodetic Least Squares ProblemsSIAM Journal on Scientific and Statistical Computing, 1986
- Numerical Methods for Large Sparse Linear Least Squares ProblemsSIAM Journal on Scientific and Statistical Computing, 1984
- Numerical Simulation of Time-Dependent Contact and Friction Problems in Rigid Body MechanicsSIAM Journal on Scientific and Statistical Computing, 1984
- A generalized conjugate gradient algorithm for solving a class of quadratic programming problemsLinear Algebra and its Applications, 1980
- On the Goldstein-Levitin-Polyak gradient projection methodIEEE Transactions on Automatic Control, 1976
- Constrained minimization methodsUSSR Computational Mathematics and Mathematical Physics, 1966
- Convex programming in Hilbert spaceBulletin of the American Mathematical Society, 1964