A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
Crossref DOI link: https://doi.org/10.1007/s10898-019-00831-9
Published Online: 2019-09-27
Published Print: 2019-12
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Chuong, T. D.
Jeyakumar, V.
Li, G.
Funding for this research was provided by:
Australian Research Council (DP180100745)
Text and Data Mining valid from 2019-09-27
Version of Record valid from 2019-09-27
Article History
Received: 13 September 2018
Accepted: 19 September 2019
First Online: 27 September 2019