New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
复制标题
基于替代方向法和凸松弛的具有少量负特征值的二次规划新全局算法
DOI:
10.1007/s12532-018-0142-9
复制
发表时间:
2018-08
影响因子:
6.3
通讯作者:
Jiming Peng
中科院分区:
文献类型:
--
作者:
Hezhi Luo;Xiaodi Bai;Gino Lim;Jiming Peng
We consider a quadratic program with a few negative eigenvalues (QP-r-NE) subject to linear and convex quadratic constraints that covers many applications and is known to be NP-hard even with one negative eigenvalue (QP1NE). In this paper, we first introduce a new global algorithm (ADMBB), which integrates several simple optimization techniques such as alternative direction method, and branch-and-bound, to find a globally optimal solution to the underlying QP within a pre-specified -tolerance. We establish the convergence of the ADMBB algorithm and estimate its complexity. Second, we develop a global search algorithm (GSA) for QP1NE that can locate an optimal solution to QP1NE within -tolerance and estimate the worst-case complexity bound of the GSA. Preliminary numerical results demonstrate that the ADMBB algorithm can effectively find a global optimal solution to large-scale QP-r-NE instances when r ≤ 10, and the GSA outperforms the ADMBB for most of the tested QP1NE instances. The software reviewed as part of this submission was given the DOI (digital object identifier) https://doi.org/10.5281/zenodo.1344739.
登录
查看更多内容
影响因子:
6.3
作者:
Jieqiu Chen;S. Burer
通讯作者:
Jieqiu Chen;S. Burer
DOI:
10.1007/s101070050003
发表时间:
2000-05
期刊:
Math. Program.
影响因子:
--
作者:
Hoai An Le Thi
通讯作者:
Hoai An Le Thi
影响因子:
2.7
作者:
Shuzhong Zhang
通讯作者:
Shuzhong Zhang
DOI:
10.1016/j.orl.2010.07.008
发表时间:
2010-09
期刊:
Oper. Res. Lett.
影响因子:
--
作者:
R. Cambini;Francesca Salvi
通讯作者:
R. Cambini;Francesca Salvi
影响因子:
2.7
作者:
S. Vavasis
通讯作者:
S. Vavasis