An algorithm for discrete Chebyshev linear approximation with linear constraints

DOI10.1002/NME.1620150602MaRDI QIDQ3862970zbMATH OpenOpenAlexFDO

Authors F. D. K. Roberts, Ian Barrodale

Publication date 1980

Published in International Journal for Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nme.1620150602

zbMATH Keywords

Barrodale and Phillips Chebyshev algorithmdiscrete Chebyshev approximation problemdual linear programming algorithmlinear constraintsnumerical results

Mathematics Subject Classification ID

Approximation with constraints (41A29) Best approximation, Chebyshev systems (41A50) Numerical mathematical programming methods (65K05) Algorithms in computer science (68W99) Linear programming (90C05)

Cited in

(3)

• Adaptive methods for solvings minimax problems^∗
• Chebyshev and L₁solutions of overdetermined systems of linear equations with bounded variables
• THE USE OF LINEAR PROGRAMMING IN THE DESIGN OF ANTENNA PATTERNS WITH PRESCRIBED NULLS AND OTHER CONSTRAINTS

This page was built for publication: An algorithm for discrete Chebyshev linear approximation with linear constraints

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