English

Equivalent Sufficient Conditions for Global Optimality of Quadratically Constrained Quadratic Program

Optimization and Control 2023-03-14 v2

Abstract

We study the equivalence of several well-known sufficient optimality conditions for a general quadratically constrained quadratic program (QCQP). The conditions are classified in two categories. The first one is for determining an optimal solution and the second one is for finding an optimal value. The first category of conditions includes the existence of a saddle point of the Lagrangian function and the existence of a rank-1 optimal solution of the primal SDP relaxation of QCQP. The second category includes ηp=ζ\eta_p = \zeta, ηd=ζ\eta_d = \zeta, and φ=ζ\varphi = \zeta, where ζ\zeta, ηp\eta_p, ηd\eta_d, and φ\varphi denote the optimal values of QCQP, the dual SDP relaxation, the primal SDP relaxation and the Lagrangian dual, respectively. We show the equivalence of these conditions with or without the existence of an optimal solution of QCQP and/or the Slater constraint qualification for the primal SDP relaxation. The results on the conditions are also extended to the doubly nonnegative relaxation of equality constrained QCQP in nonnegative variables.

Keywords

Cite

@article{arxiv.2303.05874,
  title  = {Equivalent Sufficient Conditions for Global Optimality of Quadratically Constrained Quadratic Program},
  author = {Sunyoung Kim and Masakazu Kojima},
  journal= {arXiv preprint arXiv:2303.05874},
  year   = {2023}
}

Comments

19 pages, 2 figures

R2 v1 2026-06-28T09:10:58.632Z