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

一个简单二次曲线最优化问题的牛顿括号法

A Newton-bracketing method for a simple conic optimization problem

Sunyoung Kim, Masakazu Kojima, Kim-Chuan Toh

摘要:

对于二次最优化问题(QOP)的拉格朗日-DNN松弛,我们提出了一种牛顿包围法来改善BBCPOP中的二分投影方法的性能。软件,2019年]。松弛问题被转换成的问题,找到最大的零$y^*$的连续可微(除了在$y^*$)凸函数$g : \mathbb{R} \rightarrow \mathbb{R}$,使$g(y) = 0$如果$y \leq y^*$和$g(y) > 0$否则。理论上,该方法生成的$y^*$的上下界均收敛于$y^*$ .如果$g$在$y^*$的右导数为正,则它们的收敛性是二次的。$g'(y)$的精确计算对于方法的鲁棒性是必要的,但在实际中很难实现。作为替代,我们提出了割线括号法。我们证明,该方法提高了质量的下界BBCPOP和SDPNAL+从BIQMAC的二进制QOP实例。此外,新的下界的未知的大规模QAP实例的QAPLIB的最优值。

英文摘要:

For the Lagrangian-DNN relaxation of quadratic optimization problems (QOPs), we propose a Newton-bracketing method to improve the performance of the bisection-projection method implemented in BBCPOP [to appear in ACM Tran. Softw., 2019]. The relaxation problem is converted into the problem of finding the largest zero $y^*$ of a continuously differentiable (except at $y^*$) convex function $g : \mathbb{R} \rightarrow \mathbb{R}$ such that $g(y) = 0$ if $y \leq y^*$ and $g(y) > 0$ otherwise. In theory, the method generates lower and upper bounds of $y^*$ both converging to $y^*$. Their convergence is quadratic if the right derivative of $g$ at $y^*$ is positive. Accurate computation of $g'(y)$ is necessary for the robustness of the method, but it is difficult to achieve in practice. As an alternative, we present a secant-bracketing method. We demonstrate that the method improves the quality of the lower bounds obtained by BBCPOP and SDPNAL+ for binary QOP instances from BIQMAC. Moreover, new lower bounds for the unknown optimal values of large scale QAP instances from QAPLIB are reported.

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

↑