New bounds for nonconvex quadratically constrained quadratic programming

In this paper, we study some bounds for nonconvex quadratically constrained quadratic programs (QCQPs). We propose two types of bounds for QCQPs, quadratic and cubic bounds. We use affine functions as Lagrange multipliers for quadratic bounds. We demonstrate that most semidefinite relaxations can be...

Celý popis

Podrobná bibliografie

Vydáno v:	Journal of global optimization Ročník 85; číslo 3; s. 595 - 613
Hlavní autor:	Zamani, Moslem
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.03.2023 Springer Springer Nature B.V
Témata:	Computer Science Euclidean space Lagrange multiplier Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Quadratic equations Quadratic programming Real Functions Quadratically constrained quadratic programming Reformulation-linearization technique Semidefinite relaxation
ISSN:	0925-5001, 1573-2916
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!