A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs

Thai Doan Chuong, V. Jeyakumar 0001, Guoyin Li 0001. A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs. J. Global Optimization, 75(4):885-919, 2019. [doi]

Abstract

Abstract is missing.