Hoffman's error bounds and uniform Lipschitz continuity of best \(l_ p\)-approximations
From MaRDI portal
Publication:1378404
DOI10.1006/jmaa.1997.5521zbMath0891.41016OpenAlexW2021728005MaRDI QIDQ1378404
Hubert Berens, Martina Finzel, Yuan Xu, Wu Li
Publication date: 9 July 1998
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jmaa.1997.5521
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characterizations of continuous and Lipschitz continuous metric selections in normed linear spaces
- The convergence of the best discrete linear \(L_ p\) approximation as p\(\to 1\)
- Approximation in the \(\ell_{\infty}\) norm and the generalized inverse
- Natural choice of \(L_ 1-\)approximants
- The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program
- A. J. Hoffman's theorem and metric projections in polyhedral spaces
- Continuity of metric projection, Pólya algorithm, strict best approximation, and tubularity of convex sets
- Linear approximation in \(l_ n^ \infty\)
- Smoothness of approximation
- Polya properties in
- Computing the Strict Chebyshev Solution of Overdetermined Linear Equations
- Linear Minimax Approximation as the Limit of Best $L_p $-Approximation
- A Finite Step Algorithm for Determining the “Strict” Chebyshev Solution to $Ax=b$