Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization

DOI10.1007/s10957-015-0794-9zbMath1336.90068OpenAlexW1152198286MaRDI QIDQ283932

Sunyoung Kim, Naohiko Arima, Kojima, Masakazu

Publication date: 17 May 2016

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-015-0794-9

zbMATH Keywords

copositive programmingpolynomial optimizationcompletely positive programmingmoment cone relaxation

Mathematics Subject Classification ID

Convex programming (90C25) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items

Completely positive reformulations of polynomial optimization problems with linear constraints, A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems, Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization, An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs, Completely Positive Tensors: Properties, Easily Checkable Subclasses, and Tractable Relaxations, A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• On conic QPCCs, conic QCQPs and completely positive programs
• On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
• Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
• Completely positive reformulations for polynomial optimization
• On the copositive representation of binary and continuous nonconvex quadratic programs
• Global Optimization with Polynomials and the Problem of Moments
• Variational Analysis
• A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming