Sciweavers

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

32

JGO
2010

favoriteEmaildiscussreport

96views more JGO 2010»

Solving polynomial least squares problems via semidefinite programming relaxations

13 years 5 months ago

Solving polynomial least squares problems via semidefinite programming relaxations

Download www.is.titech.ac.jp

Sunyoung Kim, Masakazu Kojima

Real-time Traffic

JGO 2010 |

claim paper

Related Content

» Approximate GCDs of polynomials and sparse SOS relaxations

» Maxmargin MultipleInstance Learning via Semidefinite Programming

» Robust SINRconstrained MISO downlink beamforming When is semidefinite programming relaxati...

» Semidefinite programming for NPlayer Games

» On linear and semidefinite programming relaxations for hypergraph matching

» Sums of squares based approximation algorithms for MAXSAT

» Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials

» Recovery of sparse perturbations in Least Squares problems

» Minimizing Polynomials via Sum of Squares over the Gradient Ideal

Post Info
More Details (n/a)

Added	19 May 2011
Updated	19 May 2011
Type	Journal
Year	2010
Where	JGO
Authors	Sunyoung Kim, Masakazu Kojima

Comments (0)