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

组合积分逼近的非均匀网格细化

Non-uniform Grid Refinement for the Combinatorial Integral Approximation

Felix Bestehorn, Christoph Hansknecht, Christian Kirches, Paul Manns

AI总结:

针对多维切换成本感知舍入问题(SCARP)求解困难,提出非均匀网格细化策略减少变量并保留逼近性质,能在限时内实现更小对偶间隙,并求解大规模实例。

摘要:

组合积分逼近(CIA)是求解整数最优控制问题的一种求解技术。为了正则化CIA产生的解,可以在其某个算法步骤中最小化切换成本。这引出了被称为切换成本感知舍入问题(SCARP)的组合优化问题。它们在一维域上可以被高效求解,但迄今为止尚未找到适用于多维域的高效求解算法。CIA问题的公式化依赖于离散化网格。我们提出通过非均匀网格细化策略来减少变量数量,从而改善SCARP的计算可处理性。我们证明了该网格细化策略保留了组合积分逼近的逼近性质。提供的计算结果表明,所提出的方法能够在规定的时间限制内,实现比均匀方法更小的对偶间隙。对于几个大规模实例,仅通过自适应性才能获得对偶界。

英文摘要:

The combinatorial integral approximation (CIA) is a solution technique for integer optimal control problems. In order to regularize the solutions produced by CIA, one can minimize switching costs in one of its algorithmic steps. This leads to combinatorial optimization problems, which are called switching cost aware rounding problems (SCARP). They can be solved efficiently on one-dimensional domains but no efficient solution algorithms have been found so far for multi-dimensional domains. The CIA problem formulation depends on a discretization grid. We propose to reduce the number of variables and thus improve the computational tractability of SCARP by means of a non-uniform grid refinement strategy. We prove that the grid refinement preserves the approximation properties of the combinatorial integral approximation. Computational results are offered to show that the proposed approach is able to achieve, within a prescribed time limit, smaller duality gaps that does the uniform approach. For several large instances, a dual bound could only be obtained through adaptivity.

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

↑