Uniform Lipschitz continuity of best \(l_p\)-approximations by polyhedral sets
From MaRDI portal
Publication:1276375
DOI10.1006/jmaa.1998.6120zbMath0915.41019OpenAlexW1492318323MaRDI QIDQ1276375
Publication date: 5 July 1999
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jmaa.1998.6120
Cites Work
- The convergence of the best discrete linear \(L_ p\) approximation as p\(\to 1\)
- The Polya algorithm on cylindrical sets
- Natural choice of \(L_ 1-\)approximants
- Continuity of metric projection, Pólya algorithm, strict best approximation, and tubularity of convex sets
- Linear approximation in \(l_ n^ \infty\)
- Hoffman's error bounds and uniform Lipschitz continuity of best \(l_ p\)-approximations
- Smoothness of approximation
- Tchebycheff approximation in a compact metric space
- Approximations in $L^p $ and Chebyshev Approximations
- Convex Analysis
This page was built for publication: Uniform Lipschitz continuity of best \(l_p\)-approximations by polyhedral sets