On iterative algorithms for linear least squares problems with bound constraints

DOI10.1016/0024-3795(91)90009-LzbMath0722.65019MaRDI QIDQ756372

Daniel Tuyttens, Michel Bierlaire, Phillipe L. Toint

Publication date: 1991

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

algorithmlarge scale problemstrust region methodsprojected gradient methodsnonlinear optimization problemsconstrained least-squares problem

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Iterative numerical methods for linear systems (65F10)

Related Items

A regularized interior-point method for constrained linear least squares, Iterative learning control for constrained linear systems, Modulus Methods for Nonnegatively Constrained Image Restoration, Least squares problems with inequality constraints as quadratic constraints, Column-oriented algebraic iterative methods for nonnegative constrained least squares problems, A hybrid multilevel-active set method for large box-constrained linear discrete ill-posed problems, A dual gradient-projection method for large-scale strictly convex quadratic problems, A Comparison of Block Pivoting and Interior-Point Algorithms for Linear Least Squares Problems with Nonnegative Variables, An iterative method for linear discrete ill-posed problems with box constraints, Fast Projection‐Based Methods for the Least Squares Nonnegative Matrix Approximation Problem, Modulus-Type Inner Outer Iteration Methods for Nonnegative Constrained Least Squares Problems, A non-monotonic method for large-scale non-negative least squares

Uses Software

• LSQR
• CRAIG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving the minimal least squares problem subject to bounds on the variables
• A direct method for sparse least squares problems with lower and upper bounds
• Algorithms for bound constrained quadratic programming problems
• Enlarging the region of convergence of Newton's method for constrained optimization
• A generalized conjugate gradient algorithm for solving a class of quadratic programming problems
• Numerical Simulation of Time-Dependent Contact and Friction Problems in Rigid Body Mechanics
• Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
• Numerical Methods for Large Sparse Linear Least Squares Problems
• A Comparison Between Some Direct and Iterative Methods for Certain Large Scale Geodetic Least Squares Problems
• On Linear Restricted and Interval Least-Squares Problems
• Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
• Correction to the Paper on Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• Inexact Newton Methods
• Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes
• On the Goldstein-Levitin-Polyak gradient projection method
• Linear Least Squares with Bounds and Linear Constraints
• A Statistical Model for Positron Emission Tomography
• Convex programming in Hilbert space
• Methods of conjugate gradients for solving linear systems