Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
