Quadratic problems with two quadratic constraints: Convex quadratic relaxation and strong lagrangian duality
Author | Hamdi, A. |
Author | Taati, A. |
Author | Almaadeed, T.A. |
Available date | 2023-09-24T07:55:31Z |
Publication Date | 2021 |
Publication Name | RAIRO - Operations Research |
Resource | Scopus |
Abstract | In this paper, we study a nonconvex quadratic minimization problem with two quadratic constraints, one of which being convex. We introduce two convex quadratic relaxations (CQRs) and discuss cases, where the problem is equivalent to exactly one of the CQRs. Particularly, we show that the global optimal solution can be recovered from an optimal solution of the CQRs. Through this equivalence, we introduce new conditions under which the problem enjoys strong Lagrangian duality, generalizing the recent condition in the literature. Finally, under the new conditions, we present necessary and sufficient conditions for global optimality of the problem. EDP Sciences, ROADEF, SMAI 2021. |
Sponsor | Acknowledgements. The authors are grateful to the referees for valuable comments and suggestions that helped us improve this article. The authors would like to thank Qatar University for the full support under the Grant NCBP-QUCP-CAS-2020-1. |
Language | en |
Publisher | EDP Sciences |
Subject | Convex quadratic relaxation Quadratically constrained quadratic programming SDO-relaxation Strong duality |
Type | Article |
Pagination | S2905-S2922 |
Volume Number | 55 |
Files in this item
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |
This item appears in the following Collection(s)
-
Mathematics, Statistics & Physics [740 items ]