arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1403.2340math.NAcs.NAmath.AP
收藏

处理变分问题中的凸性类似约束

Handling convexity-like constraints in variational problems

Quentin Mérigot, Edouard Oudet

AI总结:

本文提出一个通用框架,用于构造凸函数空间的有限维近似,并展示其在变分问题中的应用,通过近似空间与可接受集的距离估计,结合 proximal 算法实现高效求解。

摘要:

我们提供了一个通用框架,用于构造凸函数空间的有限维近似,该框架也适用于 c-凸函数空间和凸体支撑函数空间。我们给出了近似空间与可接受集之间距离的估计。此框架适用于通过网格上的分段线性函数或其他有限维空间近似凸函数。我们展示了这些离散化方法如何适合于在凸性约束下求解变分问题的数值解。我们的实现依赖于 proximal 算法,并可以轻松并行化,因此适用于二维和三维的大规模问题。我们通过三个变分问题的数值解示例展示了本方法的通用性和效率:3D 去噪、主代理问题和凸体类中的优化。

英文摘要:

We provide a general framework to construct finite dimensional approximations of the space of convex functions, which also applies to the space of c-convex functions and to the space of support functions of convex bodies. We give estimates of the distance between the approximation space and the admissible set. This framework applies to the approximation of convex functions by piecewise linear functions on a mesh of the domain and by other finite-dimensional spaces such as tensor-product splines. We show how these discretizations are well suited for the numerical solution of problems of calculus of variations under convexity constraints. Our implementation relies on proximal algorithms, and can be easily parallelized, thus making it applicable to large scale problems in dimension two and three. We illustrate the versatility and the efficiency of our approach on the numerical solution of three problems in calculus of variation : 3D denoising, the principal agent problem, and optimization within the class of convex bodies.

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

↑