The convergence of the best discrete linear \(L_ p\) approximation as p\(\to 1\)
From MaRDI portal
Publication:1061967
DOI10.1016/0021-9045(83)90080-1zbMath0571.41023OpenAlexW1972066494MaRDI QIDQ1061967
Publication date: 1983
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0021-9045(83)90080-1
Related Items (8)
Best \(L_ 1\) approximation by convex functions ⋮ Varying norms and constraints ⋮ Hoffman's error bounds and uniform Lipschitz continuity of best \(l_ p\)-approximations ⋮ Rate of convergence of the linear discrete Pólya 1-algorithm ⋮ Polya properties in ⋮ Taylor expansion of best \(l_{p}\)-approximations about \(p\) = 1 ⋮ Uniform Lipschitz continuity of best \(l_p\)-approximations by polyhedral sets ⋮ Approximation in normed linear spaces
Cites Work
- An algorithm for discrete linear \(L_ p\) approximation
- An algorithm for best approximate solutions of Ax=b with a smooth strictly convex norm
- Computational experiences with discrete L\(_p\)-approximation
- Computing the Strict Chebyshev Solution of Overdetermined Linear Equations
- Approximations in $L^p $ and Chebyshev Approximations
- A Finite Step Algorithm for Determining the “Strict” Chebyshev Solution to $Ax=b$
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The convergence of the best discrete linear \(L_ p\) approximation as p\(\to 1\)
