Solving the minimal least squares problem subject to bounds on the variables
From MaRDI portal
Publication:797970
DOI10.1007/BF01937487zbMATH Open0546.65041MaRDI QIDQ797970FDOQ797970
Authors: Per Lötstedt 
Publication date: 1984
Published in: BIT (Search for Journal in Brave)
Recommendations
- Linear Least Squares with Bounds and Linear Constraints
- Least squares problem for linear inequalities with bounds on the variables
- scientific article; zbMATH DE number 4096684
- Bounded-variable least-squares: an algorithm and applications
- On the constrained linear least-squares problem: A personal view
numerical resultsconjugate gradient methodminimum norm solutionactive set strategylinear least squares problemsdirect factorization
Linear regression; mixed models (62J05) Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Numerical computation of solutions to systems of equations (65H10)
Cites Work
- A factorization method for the solution of constrained linear least squares problems allowing subsequent data changes
- Numerically stable methods for quadratic programming
- A stable method for solving certain constrained least squares problems
- Methods for Modifying Matrix Factorizations
- Title not available (Why is that?)
- On the Numerical Solution of Constrained Least-Squares Problems
- An algorithm for linear least squares problems with equality and nonnegativity constraints
- Handbook series linear algebra. Linear least squares solutions by Householder transformations
- Title not available (Why is that?)
- Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
- Title not available (Why is that?)
- A generalized conjugate gradient algorithm for solving a class of quadratic programming problems
- An Estimate for the Condition Number of a Matrix
- Minimization of a Quadratic Function of Many Variables Subject only to Lower and Upper Bounds
- A criterion for truncation of theQR-decomposition algorithm for the singular linear least squares problem
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (22)
- Least squares problem for linear inequalities with bounds on the variables
- Modulus methods for nonnegatively constrained image restoration
- Gauss-Seidel method for least-distance problems
- On the constrained linear least-squares problem: A personal view
- On iterative algorithms for linear least squares problems with bound constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms for bound constrained quadratic programming problems
- Linear Least Squares with Bounds and Linear Constraints
- Title not available (Why is that?)
- An iterative method for linear discrete ill-posed problems with box constraints
- Bounded-variable least-squares: an algorithm and applications
- Globally convergent primal-dual active-set methods with inexact subproblem solves
- A direct method for sparse least squares problems with lower and upper bounds
- Modulus-type inner outer iteration methods for nonnegative constrained least squares problems
- LMBOPT: a limited memory method for bound-constrained optimization
- Solve exactly an under determined linear system by minimizing least squares regularized with an \(\ell_0\) penalty
- On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
- Nonmonotone strategy for minimization of quadratics with simple constraints.
- Least squares problems with inequality constraints as quadratic constraints
- A hybrid multilevel-active set method for large box-constrained linear discrete ill-posed problems
This page was built for publication: Solving the minimal least squares problem subject to bounds on the variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q797970)
