On solving biquadratic optimization via semidefinite relaxation
In 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
Volume (Year): 53 (2012)
Issue (Month): 3 (December)
|Contact details of provider:|| Web page: http://www.springer.com/math/journal/10589|
|Order Information:||Web: http://link.springer.de/orders.htm|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- NESTEROV, Yurii, 1997. "Semidefinite relaxation and nonconvex quadratic optimization," CORE Discussion Papers 1997044, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:53:y:2012:i:3:p:845-867. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.