On Linear Restricted and Interval Least-Squares Problems

DOI10.1093/imanum/8.1.23zbMath0641.65035OpenAlexW2044085087MaRDI QIDQ3782665

David I. Clark, Michael R. Osborne

Publication date: 1988

Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imanum/8.1.23

zbMATH Keywords

numerical exampleslinear complementarity problemhomotopy methodLemke's algorithmperformance comparisonrestricted least squaresconstrained linear least squares problemsinterval least squaresactive-set algorithms

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (6)

Algorithms for bound constrained quadratic programming problems ⋮ Solving interval linear least squares problems by PPS-methods ⋮ A hybrid algorithm for solving linear inequalities in a least squares sense ⋮ On iterative algorithms for linear least squares problems with bound constraints ⋮ On degeneracy in linear programming and related problems ⋮ The adventures of a simple algorithm

This page was built for publication: On Linear Restricted and Interval Least-Squares Problems