计算最优采收率的新方法:改进的近似模型
Instances of Computational Optimal Recovery: Refined Approximability Models
摘要:
基于近似能力的模型最近在最优恢复的背景下进行了研究。然而,这些模型与过度参数化不兼容,因为模型和数据一致的函数可能是无界的。这一缺点促使引进了精炼的近似模型,其特点是增加了有界性条件。因此,本文提出了两种新的模型:一种是有界性适用于目标函数(第一类),另一种是有界性适用于近似函数(第二类)。对于这两种类型的模型,恢复线性泛函的最佳映射首先描述了一个抽象的水平,然后才能有效地建设解决。通过利用半定规划技术,这些建设明确进行了一个共同的例子,涉及多项式子空间的$\mathcal{C}[-1,1]$。
英文摘要:
Models based on approximation capabilities have recently been studied in the context of Optimal Recovery. These models, however, are not compatible with overparametrization, since model- and data-consistent functions could then be unbounded. This drawback motivates the introduction of refined approximability models featuring an added boundedness condition. Thus, two new models are proposed in this article: one where the boundedness applies to the target functions (first type) and one where the boundedness applies to the approximants (second type). For both types of model, optimal maps for the recovery of linear functionals are first described on an abstract level before their efficient constructions are addressed. By exploiting techniques from semidefinite programming, these constructions are explicitly carried out on a common example involving polynomial subspaces of $\mathcal{C}[-1,1]$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。