Highly Influenced

- Published 2012 in Comp. Opt. and Appl.
DOI:10.1007/s10589-011-9437-8

We observe that in a simple one-dimensional polynomial optimization problem (POP), the ‘optimal’ values of semidefinite programming (SDP) relaxation problems reported by the standard SDP solvers converge to the optimal value of the POP, while the true optimal values of SDP relaxation problems are strictly and significantly less than that value. Some pieces… CONTINUE READING

Citations per Year

Averaging **4 citations** per year over the last 3 years.

### Presentations referencing similar topics