Solving Linear Inequalities in a Least Squares Sense

DOI10.1137/0917020zbMath0844.65024OpenAlexW2052064963MaRDI QIDQ4870654

Randall Bramley, B. Winnicka

Publication date: 27 March 1996

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0917020

zbMATH Keywords

algorithmsingular value decompositionleast squaresQR algorithmsystem of linear inequalitieslinear separability problem

Mathematics Subject Classification ID

Related Items (10)

Han-type algorithms for inconsistent systems of linear inequalities -- a unified approach ⋮ Hybrid algorithms with active set prediction for solving linear inequalities in a least squares sense ⋮ The Convergence of a Levenberg–Marquardt Method for Nonlinear Inequalities ⋮ Least squares solutions of linear inequality systems: a pedestrian approach ⋮ Robust least squares solution of linear inequalities ⋮ A hybrid algorithm for solving linear inequalities in a least squares sense ⋮ Newton's method for linear inequality systems ⋮ Arbitrary-norm separating plane ⋮ The inexact fixed matrix iteration for solving large linear inequalities in a least squares sense ⋮ Entropic perturbation method for solving a system of linear inequalities

This page was built for publication: Solving Linear Inequalities in a Least Squares Sense