The Generalized Trust-Region Sub-Problem with Additional Linear Inequality Constraints—Two Convex Quadratic Relaxations and Strong Duality

• Main Authors: Temadher A. Almaadeed, Akram Taati, Maziar Salahi, Abdelouahed Hamdi
• Format: Article
• Language: English
• Published: MDPI AG 2020-08-01
• Series: Symmetry
• Subjects: the generalized trust-region sub-problem; convex quadratic relaxation; strong duality; SDO-relaxation
• Online Access: https://www.mdpi.com/2073-8994/12/8/1369

In this paper, we study the problem of minimizing a general quadratic function subject to a quadratic inequality constraint with a fixed number of additional linear inequality constraints. Under a regularity condition, we first introduce two convex quadratic relaxations (CQRs), under two different conditions, that are minimizing a linear objective function over two convex quadratic constraints with additional linear inequality constraints. Then, we discuss cases where the CQRs return the optimal solution of the problem, revealing new conditions under which the underlying problem admits strong Lagrangian duality and enjoys exact semidefinite optimization relaxation. Finally, under the given sufficient conditions, we present necessary and sufficient conditions for global optimality of the problem and obtain a form of S-lemma for a system of two quadratic and a fixed number of linear inequalities.