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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	SIAM journal on optimization Jg. 20; H. 3; S. 1286 - 1310
Hauptverfasser:	Ling, Chen, Nie, Jiawang, Qi, Liqun, Ye, Yinyu
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Philadelphia Society for Industrial and Applied Mathematics 01.01.2009
Schlagworte:	Algorithms Approximation Eigenvalues Hierarchies Mathematical analysis Mathematical models Mathematical problems Optimization Optimization algorithms Programming Semidefinite programming Studies
ISSN:	1052-6234, 1095-7189
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!