arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2401.12415math.NAcs.NA
收藏

在高维中强制多项式逼近的非负性

On enforcing non-negativity in polynomial approximations in high dimensions

Yuan Chen, Dongbin Xiu, Xiangxiong Zhang

AI总结:

本文针对高维多项式逼近中的非负性约束,提出了基于一阶凸优化的有效算法,并通过高达200维的数值实验验证了其有效性与可扩展性。

摘要:

函数的多项式逼近在科学计算中广泛应用。在某些应用中,由于底层物理问题所施加的约束,通常需要要求多项式逼近为非负(或非正),或限制在给定范围内。因此需要有效的数值方法来强制这些条件。在本文中,我们讨论了在非负约束下进行多项式逼近的有效数值算法。我们首先阐述了约束优化问题及其原始形式和对偶形式,然后讨论了高效的一阶凸优化方法,特别关注高维问题。提供了多达$200$维的数值示例,以展示这些方法的有效性和可扩展性。

英文摘要:

Polynomial approximations of functions are widely used in scientific computing. In certain applications, it is often desired to require the polynomial approximation to be non-negative (resp. non-positive), or bounded within a given range, due to constraints posed by the underlying physical problems. Efficient numerical methods are thus needed to enforce such conditions. In this paper, we discuss effective numerical algorithms for polynomial approximation under non-negativity constraints. We first formulate the constrained optimization problem, its primal and dual forms, and then discuss efficient first-order convex optimization methods, with a particular focus on high dimensional problems. Numerical examples are provided, for up to $200$ dimensions, to demonstrate the effectiveness and scalability of the methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑