Globally solving Quadratic programs with convex objective and complementarity constraints via completely positive programming

4Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

Quadratic programs with complementarity constraints (QPCC) are NP-hard due to the nonconvexity of complementarity relation between the pairs of nonnegative variables. Most of the existing solvers are capable of solving QPCC by finding stationary solutions, which are not able to be verified as global or local optimal ones. In this paper, we aim to globally solve QPCC by a branch-and-bound algorithm, in which the doubly nonnegative (DNN) relaxation in each node is effciently solved via an augmented Lagrangian method. The method is practically effcient due to the fact that the augmented Lagrangian function can be decomposed into two easy-to-solve subproblems. Computational results demonstrate the effectiveness of the proposed algorithm, with a particular highlight in only a few nodes for some instances.

Cite

CITATION STYLE

APA

Deng, Z. B., Tian, Y., Lu, C., & Xing, W. X. (2018). Globally solving Quadratic programs with convex objective and complementarity constraints via completely positive programming. Journal of Industrial and Management Optimization, 14(2), 625–636. https://doi.org/10.3934/jimo.2017064

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free