凸性约束变分问题的数值方法
A numerical method for variational problems with convexity constraints
AI总结:
提出一种用多面体锥逼近凸函数锥的方法,将凸性约束变分问题转化为线性约束优化问题,实现高效求解。
摘要:
我们考虑在可容许函数必须为凸的约束下逼近变分问题解的问题。该问题处于凸分析、凸优化、变分问题和偏微分方程技术的交叉领域。该方法通过用可由线性不等式表示的多面体锥来逼近(非多面体)凸函数锥。这种途径导致一个具有线性约束的优化问题,可以高效计算,比现有方法快数百倍。
英文摘要:
We consider the problem of approximating the solution of variational problems subject to the constraint that the admissible functions must be convex. This problem is at the interface between convex analysis, convex optimization, variational problems, and partial differential equation techniques. The approach is to approximate the (non-polyhedral) cone of convex functions by a polyhedral cone which can be represented by linear inequalities. This approach leads to an optimization problem with linear constraints which can be computed efficiently, hundreds of times faster than existing methods.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。