Semidefinite Relaxation for Two Mixed Binary Quadratically Constrained Quadratic Programs: Algorithms and Approximation Bounds

This paper develops new semidefinite programming (SDP) relaxation techniques for two classes of mixed binary quadratically constrained quadratic programs and analyzes their approximation performance. The first class of problems finds two minimum norm vectors in N -dimensional real or complex Euclide...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of the Operations Research Society of China (Internet) Ročník 4; číslo 2; s. 205 - 221
Hlavní autori:	Xu, Zi, Hong, Ming-Yi
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Beijing Operations Research Society of China 01.06.2016 Springer Nature B.V
Predmet:	Algorithms Approximation Constraints Continuity (mathematics) Euclidean geometry Management Science Mathematics Mathematics and Statistics Operations Research Quadratic programming Quality of service Semidefinite programming 90C20 NP-hard Nonconvex quadratically constrained quadratic programming Semidefinite program relaxation 90C22 90C59 Approximation bound
ISSN:	2194-668X, 2194-6698
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!