Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

MP
2007

favoriteEmaildiscussreport

81views more MP 2007»

On approximating complex quadratic optimization problems via semidefinite programming relaxations

13 years 4 months ago

On approximating complex quadratic optimization problems via semidefinite programming relaxations

Download www.stanford.edu

Anthony Man-Cho So, Jiawei Zhang, Yinyu Ye

Real-time Traffic

MP 2007 |

claim paper

Related Content

» Semidefinite Optimization Approaches for Satisfiability and MaximumSatisfiability Problems

» Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignm...

» A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Qua...

» Solving Large Scale Binary Quadratic Problems Spectral Methods vs Semidefinite Programming

» Robust Solutions of Uncertain Quadratic and ConicQuadratic Problems

» On Quadratic Programming with a Ratio Objective

» Optimal Spectrum Sharing in MIMO Cognitive Radio Networks via Semidefinite Programming

» Product Rules in Semidefinite Programming

» Ensemble Pruning Via Semidefinite Programming

Post Info
More Details (n/a)

Added	27 Dec 2010
Updated	27 Dec 2010
Type	Journal
Year	2007
Where	MP
Authors	Anthony Man-Cho So, Jiawei Zhang, Yinyu Ye

Comments (0)