On solving biquadratic optimization via semidefinite relaxation
AbstractIn this paper, we study a class of biquadratic optimization problems. We first relax the original problem to its semidefinite programming (SDP) problem and discuss the approximation ratio between them. Under some conditions, we show that the relaxed problem is tight. Then we consider how to approximately solve the problems in polynomial time. Under several different constraints, we present variational approaches for solving them and give provable estimation for the approximation solutions. Some numerical results are reported at the end of this paper. Copyright Springer Science+Business Media, LLC 2012
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Springer in its journal Computational Optimization and Applications.
Volume (Year): 53 (2012)
Issue (Month): 3 (December)
Contact details of provider:
Web page: http://www.springer.com/math/journal/10589
You can help add them by filling out this form.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F Baum).
If references are entirely missing, you can add them using this form.