组合动力系统的Optimization逼近算法
Approximation Algorithms for Optimization of Combinatorial Dynamical Systems
摘要:
本文考虑一类动力系统的最优化问题,该系统的演化依赖于二元决策变量的集合。我们开发了可扩展的近似算法,可证明的次优界提供计算上易于处理的解决方案的方法,即使当系统的维数和二进制变量的数量是大的。所提出的方法采用了线性逼近的目标函数,使近似的问题被定义在可行空间的二进制决策变量,这是一个离散的集合。为了定义这样一个线性逼近,我们提出了两种不同的变分方法:一种使用离散空间的连续松弛,另一种使用向量场和运行支付的凸组合。该近似问题是一个0-1线性规划问题,可以用已有的多项式时间精确算法或近似算法求解,且不需要求解动力系统。此外,我们刻画了一个充分条件,确保近似解有一个可证的次优界。我们表明,这个条件可以解释为目标函数的平方。所提出的算法的性能和实用性证明与开/关控制问题的相互依存的制冷系统。
英文摘要:
This paper considers an optimization problem for a dynamical system whose evolution depends on a collection of binary decision variables. We develop scalable approximation algorithms with provable suboptimality bounds to provide computationally tractable solution methods even when the dimension of the system and the number of the binary variables are large. The proposed method employs a linear approximation of the objective function such that the approximate problem is defined over the feasible space of the binary decision variables, which is a discrete set. To define such a linear approximation, we propose two different variation methods: one uses continuous relaxation of the discrete space and the other uses convex combinations of the vector field and running payoff. The approximate problem is a 0-1 linear program, which can be solved by existing polynomial-time exact or approximation algorithms, and does not require the solution of the dynamical system. Furthermore, we characterize a sufficient condition ensuring the approximate solution has a provable suboptimality bound. We show that this condition can be interpreted as the concavity of the objective function. The performance and utility of the proposed algorithms are demonstrated with the ON/OFF control problems of interdependent refrigeration systems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。