On Well-Posedness of Some Problems in Approximation

This article is aimed at synthesizing some results on best approximants and restricted Chebyshev centres from the perspective of well-posedness of these problems. The related well-posedness notions for minimization problems are surveyed here. This leads one, in particular, to a reinterpretation of generic uniqueness results for some problems in approximation from the angle of generic well-posedness.

View article page

Download PDF