无约束二元二次问题的鲁棒优化
Robust Optimization of Unconstrained Binary Quadratic Problems
摘要:
在本文中,我们专注于无约束二进制二次优化模型,最大化x^t Qx,x二进制,并考虑确定最优解的问题,这些最优解对于Q矩阵中的扰动是鲁棒的。由于Q的大数据来源固有的不确定性和计算机数值精度的限制,特别是在一类新的量子退火计算机中,我们有动力找到鲁棒或稳定的解决方案。实验设计技术被用来生成一个不同的子集的可能的情况下,从中确定强大的解决方案。一个说明性的例子与实际应用的商业决策进行检查。所提出的方法还产生了一个表面响应方程,用于估计上限在恒定的时间内的情况下的极端Q实例。此外,被认为是通过检查的范围内的Q值的x_i是预先确定的个别x_i变量的鲁棒性的理论框架。
英文摘要:
In this paper we focus on the unconstrained binary quadratic optimization model, maximize x^t Qx, x binary, and consider the problem of identifying optimal solutions that are robust with respect to perturbations in the Q matrix.. We are motivated to find robust, or stable, solutions because of the uncertainty inherent in the big data origins of Q and limitations in computer numerical precision, particularly in a new class of quantum annealing computers. Experimental design techniques are used to generate a diverse subset of possible scenarios, from which robust solutions are identified. An illustrative example with practical application to business decision making is examined. The approach presented also generates a surface response equation which is used to estimate upper bounds in constant time for Q instantiations within the scenario extremes. In addition, a theoretical framework for the robustness of individual x_i variables is considered by examining the range of Q values over which the x_i are predetermined.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。