Error estimates and Lipschitz constants for best approximation in continuous function spaces
From MaRDI portal
Publication:1904181
DOI10.1016/0898-1221(95)00104-2zbMath0841.41026OpenAlexW2042423306MaRDI QIDQ1904181
Publication date: 18 December 1995
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://digitalcommons.odu.edu/cgi/viewcontent.cgi?article=1136&context=mathstat_fac_pubs
Best approximation, Chebyshev systems (41A50) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)
Related Items
Proof mining in \(L_{1}\)-approximation ⋮ Abadie's constraint qualification, Hoffman's error bounds, and Hausdorff strong unicity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Error bounds for nondegenerate monotone linear complementarity problems
- Introduction to sensitivity and stability analysis in nonlinear programming
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Error bounds for the linear complementarity problem with a P-matrix
- Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs
- 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
- Finite termination of the proximal point algorithm
- The distance to a polyhedron
- Global error bounds for monotone affine variational inequality problems
- On a global error bound for a class of monotone affine variational inequality problems
- Minimum principle sufficiency
- Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
- The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program
- Uniform Hausdorff strong uniqueness
- A. J. Hoffman's theorem and metric projections in polyhedral spaces
- Error bounds and strong upper semicontinuity for monotone affine variational inequalities
- On the convergence of the coordinate descent method for convex differentiable minimization
- Gauss-Seidel method for least-distance problems
- Characterization of the local Lipschitz constant
- Differentiability of the best approximation operator
- Bounds for error in the solution set of a perturbed linear program
- Some theorems on Cebysev approximation
- Weak Sharp Minima in Mathematical Programming
- Lipschitz Continuous Metric Selections in $C_0 (T)$
- Strong uniqueness in sequential linear programming
- A Condition Number for Differentiable Convex Inequalities
- Sensitivity theorems in integer linear programming
- Global Regularity Theorems
- Nonlinear Perturbation of Linear Programs
- The Relaxation Method for Solving Systems of Linear Inequalities
- Some continuity properties of polyhedral multifunctions
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- Improved Error Bounds for Underdetermined System Solvers
- An Application of Error Bounds for Convex Programming in a Linear Space
- Sharp Lipschitz Constants for Basic Optimal Solutions and Basic Feasible Solutions of Linear Programs
- On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization
- A New Algorithm for Solving Strictly Convex Quadratic Programs
- Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral Set
- Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
- Error bounds for monotone linear complementarity problems
- Error Bounds for Piecewise Convex Quadratic Programs and Applications
- Set-valued analysis
