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

DOI10.2307/2007536MaRDI QIDQ3667843zbMATH OpenOpenAlexFDO

Authors Roy L. Streit, Albert H. Nuttall

Publication date 1983

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

zbMATH Keywords

best linear approximationslinear Chebyshev approximationquasi-normssemi-infinite programming

Mathematics Subject Classification ID

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

Cited in

(4)

• 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

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