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

DOI10.1007/S10444-024-10177-WzbMATH Open1545.65082MaRDI QIDQ6601293FDOQ6601293

Authors: Linyi Yang, Lei-Hong Zhang, Ya-Nan Zhang 

Publication date: 10 September 2024

Published in: Advances in Computational Mathematics (Search for Journal in Brave)

zbMATH Keywords

linear programmingLagrange dualityinterior-point methodChebyshev approximationLawson's iteration

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51) Algorithms for approximation of functions (65D15)

Cites Work

• The AAA Algorithm for Rational Approximation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Rate of Convergence of Lawson's Algorithm
• A Unified Approach to Certain Problems of Approximation and Minimization
• Title not available (Why is that?)
• An Algorithm for Real and Complex Rational Minimax Approximation
• Linear Chebyshev Approximation in the Complex Plane Using Lawson's Algorithm
• The Lawson Algorithm and Extensions
• Numerical Chebyshev Approximation in the Complex Plane
• Sur la méthode de l'approximation minimum.
• Rational Minimax Approximation via Adaptive Barycentric Representations
• Vandermonde with Arnoldi

This page was built for publication: The \(L_q\)-weighted dual programming of the linear Chebyshev approximation and an interior-point method

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