On Well-Posedness of Some Problems in Approximation
Jump To References Section
Abstract
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.Downloads
Download data is not yet available.
Downloads
Published
2003-12-01
How to Cite
Pai, D. V. (2003). On Well-Posedness of Some Problems in Approximation. The Journal of the Indian Mathematical Society, 70(1-4), 1–16. Retrieved from http://mail.informaticsjournals.com/index.php/jims/article/view/21884
Issue
Section
Articles
License
Copyright (c) 2003 D. V. Pai
This work is licensed under a Creative Commons Attribution 4.0 International License.