Primal Methods are Better than Dual Methods for Solving Overdetermined Linear Systems in the $l_\infty $ Sense?

DOI10.1137/0726041zbMath0671.65028OpenAlexW1991619052MaRDI QIDQ3823725

Yuying Li, Andrew R. Conn, Richard H. Bartels

Publication date: 1989

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

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

zbMATH Keywords

linear programmingminimax solutionssimplex methoddual methodsoverdetermined linear systemsprimal methods

Mathematics Subject Classification ID

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

Related Items

A proximal point algorithm for minimax problems, Discontinuous piecewise linear optimization, A penalty continuation method for the \(\ell_\infty\) solution of overdetermined linear systems, Automatic decrease of the penalty parameter in exact penalty function methods, An optimal subgradient algorithm with subspace search for costly convex optimization problems, Adaptive methods for solvings minimax problems^∗, Approximation in normed linear spaces