Abstract
The main goal of this paper is to show the connection between optimization and best approximation when studying vector-valued functions defined on a finite set. For example, Hausdorff strong unicity for best approximation is shown to be equivalent to Abadie's constraint qualification for the associated convex quadratic feasibility problem.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
