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

Full description

Bibliographic Details

Published in:	SIAM journal on optimization Vol. 20; no. 3; pp. 1286 - 1310
Main Authors:	Ling, Chen, Nie, Jiawang, Qi, Liqun, Ye, Yinyu
Format:	Journal Article
Language:	English
Published:	Philadelphia Society for Industrial and Applied Mathematics 01.01.2009
Subjects:	Algorithms Approximation Eigenvalues Hierarchies Mathematical analysis Mathematical models Mathematical problems Optimization Optimization algorithms Programming Semidefinite programming Studies
ISSN:	1052-6234, 1095-7189
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!