Discrete Chebyshev Approximation with Linear Constraints

DOI10.1137/0722001zbMath0574.65033OpenAlexW2018975689MaRDI QIDQ3692707

M. Brannigan

Publication date: 1985

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

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

zbMATH Keywords

linear constraintsminimum norm solutionNumerical examplesoverdetermined systemsChebyshev approximationH-setsRemez-type ascent exchange algorithm

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Best approximation, Chebyshev systems (41A50) Approximation with constraints (41A29)

Related Items (2)

Strict Chebyshev approximation for general systems of linear equations ⋮ On solving three classes of nonlinear programming problems via simple differentiable penalty functions

This page was built for publication: Discrete Chebyshev Approximation with Linear Constraints