A multilevel analysis of the Lasserre hierarchy
A multilevel analysis of the Lasserre hierarchy
复制标题
Lasserre 层次结构的多级分析
DOI:
10.1016/j.ejor.2019.02.016
复制
发表时间:
2019
影响因子:
6.4
通讯作者:
Campos J
中科院分区:
文献类型:
--
作者:
Campos J
This paper analyzes the relation between different orders of the Lasserre hierarchy for polynomial optimization (POP). Although for some cases solving the semidefinite programming relaxation corresponding to the first order of the hierarchy is enough to solve the underlying POP, other problems require sequentially solving the second or higher orders until a solution is found. For these cases, and assuming that the lower order semidefinite programming relaxation has been solved, we develop prolongation operators that exploit the solutions already calculated to find initial approximations for the solution of the higher order relaxation. We can prove feasibility in the higher order of the hierarchy of the points obtained using the operators, as well as convergence to the optimal as the relaxation order increases. Furthermore, the operators are simple and inexpensive for problems where the projection over the feasible set is “easy” to calculate (for example integer {0, 1} and {− 1, 1} POPs). Our numerical experiments show that it is possible to extract useful information for real applications using the prolongation operators. In particular, we illustrate how the operators can be used to increase the efficiency of an infeasible interior point method by using them as an initial point. We use this technique to solve quadratic integer {0, 1} problems, as well as MAX-CUT and integer partition problems.
影响因子:
2.2
作者:
Hande Y. Benson;D. Shanno
通讯作者:
Hande Y. Benson;D. Shanno
影响因子:
2.7
作者:
E. V. Dam;R. Sotirov
通讯作者:
R. Sotirov