On computational aspects of bounded linear least squares problems

DOI10.1145/103147.103155MaRDI QIDQ4371733zbMATH OpenOpenAlexFDO

Authors Achiya Dax

Publication date 9 February 1998

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL http://www.acm.org/pubs/contents/journals/toms/1991-17/

zbMATH Keywords

active set methodsbounded least squaresdead pointsnumerical experimentsstarting point

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Recommendations

• Solving the minimal least squares problem subject to bounds on the variables
• Bounded-variable least-squares: an algorithm and applications
• Linear Least Squares with Bounds and Linear Constraints
• On the constrained linear least-squares problem: A personal view
• Linear programming via least squares

Cited in

(7)

• A hybrid algorithm for solving linear inequalities in a least squares sense
• Random projections for the nonnegative least-squares problem
• Selected bibliography on degeneracy
• The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review
• Hybrid algorithms with active set prediction for solving linear inequalities in a least squares sense
• FAST NON-NEGATIVE LEAST-SQUARES LEARNING IN THE RANDOM NEURAL NETWORK
• On iterative algorithms for linear least squares problems with bound constraints

This page was built for publication: On computational aspects of bounded linear least squares problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4371733)