Quadratic problems with two quadratic constraints: convex quadratic relaxation and strong lagrangian duality.
Abdelouahed HamdiAkram TaatiTemadher Alassiry Al-MaadeedPublished in: RAIRO Oper. Res. (2021)
Keyphrases
- convex quadratic
- inequality constraints
- duality gap
- objective function
- semidefinite
- constrained optimization
- computational complexity
- np complete
- solving problems
- equality constraints
- interior point methods
- lagrange multipliers
- optimal solution
- soft constraints
- lagrangian relaxation
- iterative algorithms
- least squares
- quadratic program
- genetic algorithm