Error estimates and Lipschitz constants for best approximation in continuous function spaces
From MaRDI portal
Let \(G\) be a finite dimensional subspace of the Banach space \(C_0 (T)\) of all real-valued continuous functions on a locally compact Hausdorff space \(T\) which vanish at infinity. Using a structural characterization of the metric projection \(P_G (f)\), \(f\in C_0 (T)\) a sharp lower bound of the strong unicity constant [see \textit{W. Li}, J. Approximation Theory 56, 164-184 (1989; Zbl 0672.41020)]\ and exact Lipschitz constant for \(P_G\) are obtained. Construction of functions with desired properties are also given.
Recommendations
- Lipschitz conditions, strong uniqueness, and almost Chebyshev subspaces of C(X)
- scientific article; zbMATH DE number 3960204
- Continuity and Lipschitz constants for projections
- Lipschitz continuity and Gateaux differentiability of the best approximation operator in vector-valued Chebyshev approximation
- A note on strong uniqueness constants
Cites work
- A Condition Number for Differentiable Convex Inequalities
- A New Algorithm for Solving Strictly Convex Quadratic Programs
- A. J. Hoffman's theorem and metric projections in polyhedral spaces
- An Application of Error Bounds for Convex Programming in a Linear Space
- Bounds for error in the solution set of a perturbed linear program
- Characterization of the local Lipschitz constant
- Differentiability of the best approximation operator
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral Set
- Error bounds and strong upper semicontinuity for monotone affine variational inequalities
- Error bounds for monotone linear complementarity problems
- Error bounds for nondegenerate monotone linear complementarity problems
- Error Bounds for Piecewise Convex Quadratic Programs and Applications
- Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs
- Error bounds for the linear complementarity problem with a P-matrix
- Finite termination of the proximal point algorithm
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Gauss-Seidel method for least-distance problems
- Global error bounds for monotone affine variational inequality problems
- Global Regularity Theorems
- scientific article; zbMATH DE number 3849762 (Why is no real title available?)
- scientific article; zbMATH DE number 3915531 (Why is no real title available?)
- scientific article; zbMATH DE number 4021826 (Why is no real title available?)
- scientific article; zbMATH DE number 4063877 (Why is no real title available?)
- scientific article; zbMATH DE number 3791104 (Why is no real title available?)
- scientific article; zbMATH DE number 52731 (Why is no real title available?)
- scientific article; zbMATH DE number 89032 (Why is no real title available?)
- scientific article; zbMATH DE number 3634009 (Why is no real title available?)
- scientific article; zbMATH DE number 3797486 (Why is no real title available?)
- scientific article; zbMATH DE number 841069 (Why is no real title available?)
- Improved Error Bounds for Underdetermined System Solvers
- Introduction to sensitivity and stability analysis in nonlinear programming
- Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
- Lipschitz Continuous Metric Selections in C₀ (T)
- Minimum principle sufficiency
- Nonlinear Perturbation of Linear Programs
- On a global error bound for a class of monotone affine variational inequality problems
- On the convergence of the coordinate descent method for convex differentiable minimization
- On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- Sensitivity theorems in integer linear programming
- Set-valued analysis
- Sharp Lipschitz Constants for Basic Optimal Solutions and Basic Feasible Solutions of Linear Programs
- Some continuity properties of polyhedral multifunctions
- Some theorems on Cebysev approximation
- Strong uniqueness and Lipschitz continuity of metric projections: A generalization of the classical Haar theory
- Strong uniqueness and second order convergence in nonlinear discrete approximation
- Strong uniqueness in sequential linear programming
- Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
- The distance to a polyhedron
- The Relaxation Method for Solving Systems of Linear Inequalities
- The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program
- Uniform Hausdorff strong uniqueness
- Weak Sharp Minima in Mathematical Programming
Cited in
(11)- Continuity and Lipschitz constants for projections
- Abadie's constraint qualification, Hoffman's error bounds, and Hausdorff strong unicity
- Average error bounds of best approximation of continuous functions on the Wiener space
- Hoffman's error bounds and uniform Lipschitz continuity of best \(l_ p\)-approximations
- Characterization of generalized Haar spaces
- Lipschitzian complete error calculus and Dirichlet forms
- Proof mining in \(L_{1}\)-approximation
- scientific article; zbMATH DE number 6268890 (Why is no real title available?)
- About the error term for best approximation with respect to the Hausdorff related metrics
- Lipschitz continuity of best approximations and Chebyshev centers
- Lipschitz continuity of the best approximation operator in vector-valued Chebyshev approximation
This page was built for publication: Error estimates and Lipschitz constants for best approximation in continuous function spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1904181)
