Quadratic problems with two quadratic constraints: convex quadratic relaxation and strong lagrangian duality

DOI10.1051/RO/2020130zbMath1472.90081OpenAlexW3105384231MaRDI QIDQ5002413

Temadher A. Almaadeed, Akram Taati, Abdelouahed Hamdi

Publication date: 27 July 2021

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2020130

zbMATH Keywords

quadratically constrained quadratic programmingstrong dualityconvex quadratic relaxationSDO-relaxation

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items (1)

Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition

This page was built for publication: Quadratic problems with two quadratic constraints: convex quadratic relaxation and strong lagrangian duality