arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2403.09213math.OC
收藏

关于二维全变差正则化混合整数最优控制中整数子问题的离散化分析

On Discrete Subproblems in Integer Optimal Control with Total Variation Regularization in Two Dimensions

Paul Manns, Marvin Severitt

AI总结:

本文分析了源自二维全变差正则化混合整数最优控制信赖域算法的离散整数线性规划子问题,利用多面体顶点结构限制推导出割平面、分支规则与原始启发式算法,在标准求解器中实现了中等规模问题的显著加速。

摘要:

我们分析了通过对二维子问题进行离散化得到的整数线性规划,这些子问题源自采用全变差正则化的混合整数最优控制问题的信赖域算法。我们讨论了离散化问题的NP困难性及其与基于图的问题的联系。我们证明了底层多面体在其顶点中表现出结构限制,即关于哪些变量可以同时取分数值。基于这一性质,我们利用与最短路径和最小二分问题的关系推导出割平面。我们提出了一种分支规则和一种改进先前找到的可行点的原始启发式算法。我们在标准整数规划求解器中通过数值基准验证了所提出的工具。我们观察到中等规模问题的显著加速。我们的结果为未来向更大规模实例扩展提供了线索。

英文摘要:

We analyze integer linear programs which we obtain after discretizing two-dimensional subproblems arising from a trust-region algorithm for mixed integer optimal control problems with total variation regularization. We discuss NP-hardness of the discretized problems and the connection to graph-based problems. We show that the underlying polyhedron exhibits structural restrictions in its vertices with regards to which variables can attain fractional values at the same time. Based on this property, we derive cutting planes by employing a relation to shortest-path and minimum bisection problems. We propose a branching rule and a primal heuristic which improves previously found feasible points. We validate the proposed tools with a numerical benchmark in a standard integer programming solver. We observe a significant speedup for medium-sized problems. Our results give hints for scaling towards larger instances in the future.

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

↑