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

DOI10.1007/S10957-015-0794-9MaRDI QIDQ283932zbMATH OpenOpenAlexFDO

Authors Naohiko Arima, Sunyoung Kim, Masakazu Kojima

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

polynomial optimizationcompletely positive programmingcopositive programmingmoment cone relaxation

Mathematics Subject Classification ID

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

Recommendations

• Linear optimization with cones of moments and nonnegative polynomials
• A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
• Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
• Completely positive reformulations for polynomial optimization
• An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones

Cites work

• scientific article; zbMATH DE number 1266748 (Why is no real title available?)
• A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming
• Completely positive reformulations for polynomial optimization
• Global optimization with polynomials and the problem of moments
• On conic QPCCs, conic QCQPs and completely positive programs
• On the copositive representation of binary and continuous nonconvex quadratic programs
• On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
• Simplified copositive and Lagrangian relaxations for linearly constrained quadratic optimization problems in continuous and binary variables
• Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
• Variational Analysis

Cited in

(10)

• A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
• Cones of multipowers and combinatorial optimization problems
• Completely positive tensors: properties, easily checkable subclasses, and tractable relaxations
• Linear optimization with cones of moments and nonnegative polynomials
• Further development in convex conic reformulation of geometric nonconvex conic optimization problems
• Completely positive reformulations of polynomial optimization problems with linear constraints
• An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
• A geometrical analysis on convex conic reformulations of quadratic and polynomial optimization problems
• A GENERAL FRAMEWORK FOR CONVEX RELAXATION OF POLYNOMIAL OPTIMIZATION PROBLEMS OVER CONES
• Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization

This page was built for publication: Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q283932)