scientific article; zbMATH DE number 7313236
From MaRDI portal
Publication:4963668
zbMath1454.90041MaRDI QIDQ4963668
Naohiko Arima, Sunyoung Kim, Kim-Chuan Toh, Kojima, Masakazu
Publication date: 19 February 2021
Full work available at URL: http://yokohamapublishers.jp/online-p/PJO/vol15/pjov15n3p415.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
polynomial optimization problemmoment cone relaxationa hierarchy of the Lagrangian-SDP relaxationsSOS relaxation
Convex programming (90C25) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items
A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems, A robust Lagrangian-DNN method for a class of quadratic optimization problems, Algorithm 996, Completely Positive Tensors: Properties, Easily Checkable Subclasses, and Tractable Relaxations, A Newton-bracketing method for a simple conic optimization problem
