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

Uložené v:
Podrobná bibliografia
Vydané v:Journal of global optimization Ročník 85; číslo 3; s. 595 - 613
Hlavný autor: Zamani, Moslem
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York Springer US 01.03.2023
Springer
Springer Nature B.V
Predmet:
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 prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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 obtained as the dual of a quadratic bound. In addition, we study bounds obtained by changing the ground set. For cubic bounds, in addition to affine multipliers we employ quadratic functions. We provide a comparison between the proposed cubic bound and typical bounds for standard quadratic programs. Moreover, we report comparison results of some quadratic and cubic bounds.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0925-5001
1573-2916
DOI:10.1007/s10898-022-01224-1