An Efficient Blend of the First Algorithm of Remes

In this article we find the best simultaneous sum-approximation to a given function with respect to the sup and the L2 norms. The algorithm we develop is a blend of the First Algorithm of Remes and an efficient update of quadratic programming. This algorithm is very fast indeed and it exceeds several orders of magnitude the speed of the standard convex programming.