Convex approximations of analytic functions
作者：
Highlights：
•
摘要
We introduce a method for constructing the best approximation of an analytic function in a subclass K∗⊂K of convex functions, in the sense of the L2 norm. The construction is based on solving a certain semi-infinite quadratic programming problem, which may be of independent interest.
论文关键词：Univalent function,Convex function,Approximation of analytic functions,Quadratic programming,Karush–Kuhn–Tucker conditions
论文评审过程：Available online 15 February 2014.
论文官网地址：https://doi.org/10.1016/j.amc.2014.01.089
