Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations

This paper studies the so-called biquadratic optimization over unit spheres ... , subject to ... . The authors show that this problem is NP-hard, and there is no polynomial time algorithm returning a positive relative approximation bound. Then, they present various approximation methods based on sem...

Celý popis

Podrobná bibliografia

Vydané v:	SIAM journal on optimization Ročník 20; číslo 3; s. 1286 - 1310
Hlavní autori:	Ling, Chen, Nie, Jiawang, Qi, Liqun, Ye, Yinyu
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Philadelphia Society for Industrial and Applied Mathematics 01.01.2009
Predmet:	Algorithms Approximation Eigenvalues Hierarchies Mathematical analysis Mathematical models Mathematical problems Optimization Optimization algorithms Programming Semidefinite programming Studies
ISSN:	1052-6234, 1095-7189
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!