On iterative algorithms for linear least squares problems with bound constraints
From MaRDI portal
Publication:756372
Recommendations
- An iterative approach to a constrained least squares problem
- On computational aspects of bounded linear least squares problems
- An iterative method for the least squares solutions of the linear matrix equations with some constraint
- Iterative Methods for Equality-Constrained Least Squares Problems
- An iteration method to solve multiple constrained least squares problems
- scientific article; zbMATH DE number 6263059
- Iterative refinement for constrained and weighted linear least squares
- Iterative methods for linear least-squares problems
- An iterative method for a different constrained least square solution of linear matrix equations
Cites work
- scientific article; zbMATH DE number 4215266 (Why is no real title available?)
- scientific article; zbMATH DE number 3725604 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- scientific article; zbMATH DE number 3257595 (Why is no real title available?)
- A Comparison Between Some Direct and Iterative Methods for Certain Large Scale Geodetic Least Squares Problems
- A Statistical Model for Positron Emission Tomography
- A direct method for sparse least squares problems with lower and upper bounds
- A generalized conjugate gradient algorithm for solving a class of quadratic programming problems
- Algorithms for bound constrained quadratic programming problems
- Convex programming in Hilbert space
- Correction to the Paper on Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Enlarging the region of convergence of Newton's method for constrained optimization
- Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
- Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes
- Inexact Newton Methods
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Linear Least Squares with Bounds and Linear Constraints
- Methods of conjugate gradients for solving linear systems
- Numerical Methods for Large Sparse Linear Least Squares Problems
- Numerical Simulation of Time-Dependent Contact and Friction Problems in Rigid Body Mechanics
- On Linear Restricted and Interval Least-Squares Problems
- On the Goldstein-Levitin-Polyak gradient projection method
- Solving the minimal least squares problem subject to bounds on the variables
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
Cited in
(13)- Iterative learning control for constrained linear systems
- A Comparison of Block Pivoting and Interior-Point Algorithms for Linear Least Squares Problems with Nonnegative Variables
- A regularized interior-point method for constrained linear least squares
- Modulus methods for nonnegatively constrained image restoration
- A dual gradient-projection method for large-scale strictly convex quadratic problems
- Column-oriented algebraic iterative methods for nonnegative constrained least squares problems
- Fast Projection‐Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
- Conditional gradient algorithm for solving operator equation least squares problem under the bound constraints
- A non-monotonic method for large-scale non-negative least squares
- Least squares problems with inequality constraints as quadratic constraints
- Modulus-type inner outer iteration methods for nonnegative constrained least squares problems
- A hybrid multilevel-active set method for large box-constrained linear discrete ill-posed problems
- An iterative method for linear discrete ill-posed problems with box constraints
This page was built for publication: On iterative algorithms for linear least squares problems with bound constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q756372)
