Hoffman's error bounds and uniform Lipschitz continuity of best l_ p-approximations
Hoffman's error bounds and uniform Lipschitz continuity of best \(l p\)-approximations
\textit{R. Holmes} and \textit{B. Kripke} [Mich. Math. J. 15, 225-248 (1968; Zbl 0177.16201)] proved that on \((\mathbb R^n, |\cdot|)\) endowed with the \(l_p\)-norm, \(1 < p < \infty\), the metric projection \(P_M\) onto the linear subspace \(M\) of \(\mathbb R^n\) is Lipschitz continuous with the constant depending of p. The main result of this paper is Theorem 1. Let \(M\) be a linear subspace of \((\mathbb R^n, |\cdot|)\). Then there exists a constant \(\lambda \) independent of p such that \[ |P_M(x) - P_M(y)|_p \leq \lambda |x-y|_p, \qquad \forall\quad x,y\in \mathbb R^n, 1 < p < \infty. \] Using a variation of Hoffman's error bound for approximate solutions of systems of linear inequalities the authors obtain matrix inequalities and finally the uniform Lipschitz constant \(\lambda\). As a consequence it follows the Lipschitz continuity for a selection of \(P_M\) in the case \(p=1\) and \(p=\infty\).
- Error estimates and Lipschitz constants for best approximation in continuous function spaces
- Uniform Lipschitz continuity of best \(l_p\)-approximations by polyhedral sets
- Best uniform approximation of a bounded function by extensions of Semi-Lipschitz functions
- scientific article; zbMATH DE number 4006915
- Best uniform approximation of semi-Lipschitz functions by extensions
- Unboundedness of the Lipschitz constants of best polynomial approximation
- scientific article; zbMATH DE number 3990027
- On best approximation in \(L_ p\) spaces
- scientific article; zbMATH DE number 996923
- Boundedness of the best approximation constant in \(L_p,\)\,\,\,\(0<p<1\)
- A Finite Step Algorithm for Determining the “Strict” Chebyshev Solution to Ax=b
- A. J. Hoffman's theorem and metric projections in polyhedral spaces
- Approximation in the \(\ell_{\infty}\) norm and the generalized inverse
- Characterizations of continuous and Lipschitz continuous metric selections in normed linear spaces
- Computing the Strict Chebyshev Solution of Overdetermined Linear Equations
- Continuity of metric projection, Pólya algorithm, strict best approximation, and tubularity of convex sets
- scientific article; zbMATH DE number 89032 (Why is no real title available?)
- scientific article; zbMATH DE number 729050 (Why is no real title available?)
- scientific article; zbMATH DE number 898127 (Why is no real title available?)
- scientific article; zbMATH DE number 3261767 (Why is no real title available?)
- scientific article; zbMATH DE number 3329342 (Why is no real title available?)
- Linear approximation in \(l_ n^ \infty\)
- Linear Minimax Approximation as the Limit of Best L_p -Approximation
- Natural choice of \(L_ 1-\)approximants
- Polya properties in
- Smoothness of approximation
- The convergence of the best discrete linear \(L_ p\) approximation as p\(\to 1\)
- The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program
- Continuity and Lipschitz constants for projections
- Uniform Lipschitz continuity of best \(l_p\)-approximations by polyhedral sets
- A. J. Hoffman's theorem and metric projections in polyhedral spaces
- A note of Lipschitz constants for solutions of linear inequalities and equations
- Lipschitz continuity of oblique projections
- scientific article; zbMATH DE number 890853 (Why is no real title available?)
- scientific article; zbMATH DE number 898127 (Why is no real title available?)
This page was built for publication: Hoffman's error bounds and uniform Lipschitz continuity of best \(l_ p\)-approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1378404)
