The Lq-weighted dual programming of the linear Chebyshev approximation and an interior-point method

• Published in: Advances in computational mathematics Vol. 50; no. 4
• Main Authors: Linyi, Yang, Lei-Hong, Zhang, Ya-Nan, Zhang
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.08.2024; Springer Nature B.V
• Subjects: Chebyshev approximation; Computational Mathematics and Numerical Analysis; Computational Science and Engineering; Convergence; Mathematical and Computational Biology; Mathematical Modeling and Industrial Mathematics; Mathematics; Mathematics and Statistics; Minimax technique; Programming; Visualization; 97N30; Lawson’s iteration; Lagrange duality; 90C51; 97N50; Chebyshev approximation; Linear programming; 68W25; 33F05; Interior-point method

Given samples of a real or complex-valued function on a set of distinct nodes, the traditional linear Chebyshev approximation is to compute the minimax approximation on a prescribed linear functional space. Lawson’s iteration is a classical and well-known method for the task. However, Lawson’s itera...