Necessary conditions for Pareto optimality in constrained simultaneous Chebyshev best approximation, derived from an abstract characterization theory of Pareto optimality, are presented. The generality of the formulation of the approximation problem dealt with here makes the results applicable to a large variety of concrete simultaneous best approximation problems. Some open problems are briefly described.
Bibliographical noteFunding Information:
Work for this paper was supported by NIH Grants HL 18968, NL 4664, and RR7. The material presented here is based on part of the author’s doctoral thesis cvritten under the direction of ProfessoAr di Ben-Israeal t the Technion, Haifa, Israel. The author wishes to thank Professor Ben-Israel for his constant help and encoEuragement.
ASJC Scopus subject areas
- Numerical Analysis
- Mathematics (all)
- Applied Mathematics