2018 journal article

A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems

OPTIMIZATION, 67(2), 359–375.

co-author countries: China 🇨🇳 United States of America 🇺🇸
author keywords: Branch-and-cut algorithm; nonconvex quadratically constrained quadratic programming; polar cut; semidefinite relaxation
Source: Web Of Science
Added: August 6, 2018

In this paper, we propose a branch-and-cut algorithm for solving a nonconvex quadratically constrained quadratic programming (QCQP) problem with a nonempty bounded feasible domain. The problem is f...