Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
Crossref DOI link: https://doi.org/10.1007/s10898-015-0356-6
Published Online: 2015-08-28
Published Print: 2016-06
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Jeyakumar, V.
Kim, S.
Lee, G. M.
Li, G.
Text and Data Mining valid from 2015-08-28