Uniform Lipschitz continuity of best l_p-approximations by polyhedral sets
Uniform Lipschitz continuity of best \(l p\)-approximations by polyhedral sets
Let \(\mathbb{R}^n\) be endowed with the \(p\)-norm, \(1<p<\infty\), and let \(K\) denote a polyhedral subset of \(\mathbb{R}^n\). The authors prove that the metric projection \(\Pi_{K,p}\) onto \(K\) of \(\mathbb{R}^n\) is uniformly Lipschitz continuous with respect to \(p\). As a consequence it follows that the strict best approximation and the natural best approximation are Lipschitz continuous selections for the metric projections \(\Pi_{K,\infty}\), and \(\Pi_{K, 1}\), respectively. The paper extends an analogous result on linear subspaces obtained by \textit{H. Berens}, \textit{M. Finzel}, \textit{W. Li} and \textit{Y. Xu} [J. Math. Anal. Appl. 213, No. 1, 183-201 (1997; Zbl 0891.41016)].
- Approximations in L^p and Chebyshev Approximations
- Continuity of metric projection, Pólya algorithm, strict best approximation, and tubularity of convex sets
- Convex Analysis
- Hoffman's error bounds and uniform Lipschitz continuity of best \(l_ p\)-approximations
- Linear approximation in \(l_ n^ \infty\)
- Natural choice of \(L_ 1-\)approximants
- Smoothness of approximation
- Tchebycheff approximation in a compact metric space
- The convergence of the best discrete linear \(L_ p\) approximation as p\(\to 1\)
- The Polya algorithm on cylindrical sets
This page was built for publication: Uniform Lipschitz continuity of best \(l_p\)-approximations by polyhedral sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1276375)
