A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity

Xiaoli Cen () and Yong Xia ()
Additional contact information
Xiaoli Cen: Key Laboratory of Ministry of Education for Information Mathematics and Behavior, School of Mathematical Sciences, Beihang University, Beijing 100191, China
Yong Xia: Key Laboratory of Ministry of Education for Information Mathematics and Behavior, School of Mathematical Sciences, Beihang University, Beijing 100191, China

INFORMS Journal on Computing, 2021, vol. 33, issue 4, 1368-1383

Abstract: We consider the classical convex constrained nonconvex quadratic programming problem where the Hessian matrix of the objective to be minimized has r negative eigenvalues, denoted by (QP r ). Based on a biconvex programming reformulation in a slightly higher dimension, we propose a novel branch-and-bound algorithm to solve (QP 1 ) and show that it returns an ɛ -approximate solution of (QP 1 ) in at most O ( 1 / ɛ ) iterations. We further extend the new algorithm to solve the general (QP r ) with r > 1. Computational comparison shows the efficiency of our proposed global optimization method for small r . Finally, we extend the explicit relaxation approach for (QP 1 ) to (QP r ) with r > 1. Summary of Contribution: Nonconvex quadratic program (QP) is a classical optimization problem in operations research. This paper aims at globally solving the QP where the Hessian matrix of the objective to be minimized has r negative eigenvalues. It is known to be nondeterministic polynomial-time hard even when r = 1. This paper presents a novel algorithm to globally solve the QP for r = 1 and then extends to general r . Numerical results demonstrate the superiority of the proposed algorithm in comparison with state-of-the-art algorithms/software for small r .

Keywords: quadratic programming; quadratically constrained quadratic programming; branch and bound (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/ijoc.2020.1017 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orijoc:v:33:y:2021:i:4:p:1368-1383

Access Statistics for this article

More articles in INFORMS Journal on Computing from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().