The Generalized Trust-Region Sub-Problem with Additional Linear Inequality Constraints—Two Convex Quadratic Relaxations and Strong Duality
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 c...
Main Authors: | Temadher A. Almaadeed, Akram Taati, Maziar Salahi, Abdelouahed Hamdi |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2020-08-01
|
Series: | Symmetry |
Subjects: | |
Online Access: | https://www.mdpi.com/2073-8994/12/8/1369 |
Similar Items
-
Some remarks on duality and optimality of a class of constrained convex quadratic minimization problems
by: Roy Sudipta, et al.
Published: (2017-01-01) -
Relaxations in mixed-integer quadratically constrained programming and robust programming
by: Wang, Guanglei
Published: (2016) -
Duality of locally quasi-convex convergence groups
by: Pranav Sharma
Published: (2021-04-01) -
A convex relaxation approach for power flow problem
by: Saeed D. Manshadi, et al.
Published: (2019-01-01) -
Convexity and duality in optimization theory
by: Young, Stephen K
Published: (2005)