![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_open_medium.gif)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_restricted_medium.gif)
On Well-Posedness of Some Problems in Approximation
Subscribe/Renew Journal
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.
Subscription
Login to verify subscription
User
Font Size
Information
![](https://i-scholar.in/public/site/images/abstractview.png)
Abstract Views: 218
![](https://i-scholar.in/public/site/images/pdfview.png)
PDF Views: 0