scientific article; zbMATH DE number 7313236
From MaRDI portal
Publication:4963668
zbMATH Open1454.90041MaRDI QIDQ4963668FDOQ4963668
Naohiko Arima, Sunyoung Kim, Kim-Chuan Toh, Masakazu Kojima
Publication date: 19 February 2021
Full work available at URL: http://yokohamapublishers.jp/online-p/PJO/vol15/pjov15n3p415.pdf
Title of this publication is not available (Why is that?)
polynomial optimization problemmoment cone relaxationa hierarchy of the Lagrangian-SDP relaxationsSOS relaxation
Quadratic programming (90C20) Convex programming (90C25) Nonconvex programming, global optimization (90C26)
Cited In (9)
- Lagrangian quadratic bounds in polynomial nonconvex and Boolean models with superfluous constraints
- A Lagrangian Relaxation for Golomb Rulers
- A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems
- Completely positive tensors: properties, easily checkable subclasses, and tractable relaxations
- Further development in convex conic reformulation of geometric nonconvex conic optimization problems
- Algorithm 996
- A Newton-bracketing method for a simple conic optimization problem
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions
- A robust Lagrangian-DNN method for a class of quadratic optimization problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4963668)
