This website requires JavaScript.

A Unified Early Termination Technique for Primal-dual Algorithms in Mixed Integer Conic Programming

Yuwen ChenCatherine NingPaul Goulart
Mar 2023
摘要
We propose an early termination technique for mixed integer conic programmingfor use within branch-and-bound based solvers. Our approach generalizesprevious early termination results for ADMM-based solvers to a broader class ofprimal-dual algorithms, including both operator splitting methods and interiorpoint methods. The complexity for checking early termination is $O(n)$ for eachtermination check assuming a bounded problem domain. We show that this domainrestriction can be relaxed for problems whose data satisfies a simple rankcondition, in which case each check requires an $O(n^2)$ solve using a linearsystem that must be factored only once at the root node. We further show howthis approach can be used in hybrid model predictive control as long as systeminputs are bounded. Numerical results show that our method leads to a moderatereduction in the total iterations required for branch-and-bound conic solverswith interior-point based subsolvers.
展开全部
图表提取

暂无人提供速读十问回答

论文十问由沈向洋博士提出,鼓励大家带着这十个问题去阅读论文,用有用的信息构建认知模型。写出自己的十问回答,还有机会在当前页面展示哦。

Q1论文试图解决什么问题?
Q2这是否是一个新的问题?
Q3这篇文章要验证一个什么科学假设?