Convex approximations of analytic functions

We introduce a method for constructing the best approximation of an analytic function in a subclass K∗⊂KK∗⊂K of convex functions, in the sense of the L2L2 norm. The construction is based on solving a certain semi-infinite quadratic programming problem, which may be of independent interest.