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

带有完整性约束的优化中全变差的离散化

Discretization of Total Variation in Optimization with Integrality Constraints

Annika Schiemann, Paul Manns

AI总结:

本文研究带完整性约束的全变差正则化无穷维优化问题的离散化,通过在更细网格上离散化输入函数并引入网格尺寸超线性耦合,解决了恢复序列无法达到非整数值的问题,并证明了离散极小化序列的收敛性。

摘要:

我们引入了具有全变差正则化和优化变量完整性约束的无穷维优化问题的离散化。我们推进了使用 Raviart--Thomas 函数对全变差项对偶形式的离散化,该方法在文献中已用于某些凸问题。由于我们存在完整性约束,Caillaud 和 Chambolle [10] 的先前分析不再成立。甚至较弱的 Γ-收敛结果也不再成立,因为恢复序列通常需要达到非整数值才能恢复极限函数的全变差。我们通过在嵌入的更细网格上引入输入函数的离散化来解决这个问题。网格尺寸的超线性耦合意味着在 Raviart--Thomas 变分法的较粗网格上进行平均,这使得能够用整数值离散化输入函数恢复整数值极限函数的全变差。此外,我们能够通过其极限的全变差和取决于网格尺寸比的误差来估计恢复序列的离散化全变差。对于离散化优化问题,我们额外添加了一个在极限中消失的约束,并强制极小化序列的紧致性,从而产生它们向原问题极小化子的收敛。该约束包含一个自由度,其允许范围已确定。正如我们通过成像示例所证明的,它的选择在实践中可能对解决方案产生强烈影响。

英文摘要:

We introduce discretizations of infinite-dimensional optimization problems with total variation regularization and integrality constraints on the optimization variables. We advance the discretization of the dual formulation of the total variation term with Raviart--Thomas functions which is known from literature for certain convex problems. Since we have an integrality constraint, the previous analysis from Caillaud and Chambolle [10] does not hold anymore. Even weaker $Γ$-convergence results do not hold anymore because the recovery sequences generally need to attain non-integer values to recover the total variation of the limit function. We solve this issue by introducing a discretization of the input functions on an embedded, finer mesh. A superlinear coupling of the mesh sizes implies an averaging on the coarser mesh of the Raviart--Thomas ansatz, which enables to recover the total variation of integer-valued limit functions with integer-valued discretized input functions. Moreover, we are able to estimate the discretized total variation of the recovery sequence by the total variation of its limit and an error depending on the mesh size ratio. For the discretized optimization problems, we additionally add a constraint that vanishes in the limit and enforces compactness of the sequence of minimizers, which yields their convergence to a minimizer of the original problem. This constraint contains a degree of freedom whose admissible range is determined. Its choice may have a strong impact on the solutions in practice as we demonstrate with an example from imaging.

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

↑