Transformation of Some Mixed Approximation Problems by Optimization Methods
Miguel A. Jiménez, Estela L. Juárez, Francisco Guerra · Optimization · 2002
The present paper considers the approximation of a function in the L 2 -norm by functions in a Haar space subject to a constraint set defined by the sup norm. This problem is examined from developments of the Karush-Kuhn-Tucker theorem for semi-infinite programming as well as from the multiobjective optimization approach. An extreme feasible set is characterized with the help of a version of the Chebyshev alternation theorem.