Linear best approximation using a class of \(k\)-major \(l_ p\) norms

DOI10.1007/BF02145701zbMath0814.41025OpenAlexW2054492580MaRDI QIDQ1339039

G. Alistair Watson

Publication date: 1 December 1994

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02145701

zbMATH Keywords

best approximationdescent method\(k\)-major norm\(l_ p\) norms

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)

Cites Work

• Unnamed Item
• Unnamed Item
• Variations on the Chebyshev and \(L^ q\) theories of best approximation
• The Chebyshev theory of a variation of \(L_ p(1<p<\infty)\) approximation
• A variation of rational \(L_ 1\) approximation
• The Chebyshev theory of a variation of \(L\) approximation
• Best approximation using a peak norm
• Linear best approximation using a class of polyhedral norms
• On \(k\)-major norms and \(k\)-minor antinorms
• On approximation using a peak norm
• Best multipoint local \(L_ p\) approximation
• Minimization Techniques for Piecewise Differentiable Functions: The $l_1$ Solution to an Overdetermined Linear System
• Convex Analysis

This page was built for publication: Linear best approximation using a class of \(k\)-major \(l_ p\) norms