A Note on the Semi-Infinite Programming Approach to Complex Approximation

DOI10.2307/2007536zbMath0518.65013OpenAlexW4236185916MaRDI QIDQ3667843

Albert H. Nuttall, Roy L. Streit

Publication date: 1983

Full work available at URL: https://doi.org/10.2307/2007536

zbMATH Keywords

semi-infinite programmingquasi-normslinear Chebyshev approximationbest linear approximations

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Best approximation, Chebyshev systems (41A50) Semi-infinite programming (90C34) Approximation in the complex plane (30E10) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05)

Related Items

An optimum iterative method for solving any linear system with a square matrix ⋮ A cutting plane method for solving minimax problems in the complex plane ⋮ Design of ODMA digital waveforms using non-convex optimization methods ⋮ Proxy-GMRES: Preconditioning via GMRES in Polynomial Space

This page was built for publication: A Note on the Semi-Infinite Programming Approach to Complex Approximation