Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization
From MaRDI portal
Publication:283932
DOI10.1007/S10957-015-0794-9zbMATH Open1336.90068OpenAlexW1152198286MaRDI QIDQ283932FDOQ283932
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
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
Quadratic programming (90C20) Convex programming (90C25) Nonconvex programming, global optimization (90C26)
Cites Work
- Variational Analysis
- Global optimization with polynomials and the problem of moments
- Title not available (Why is that?)
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Simplified copositive and Lagrangian relaxations for linearly constrained quadratic optimization problems in continuous and binary variables
- A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Completely positive reformulations for polynomial optimization
- On conic QPCCs, conic QCQPs and completely positive programs
- On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
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
- A geometrical analysis on convex conic reformulations of quadratic and polynomial optimization problems
- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
- 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)
