A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming
From MaRDI portal
Publication:5408222
DOI10.1137/120890636zbMath1304.90152OpenAlexW1985181089MaRDI QIDQ5408222
Sunyoung Kim, Kojima, Masakazu, Naohiko Arima
Publication date: 9 April 2014
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/31cb40d17163e7085c35284a36aef791af6cbb6b
copositive programminghierarchy of copositivityquadratic optimization problem with quadratic constraints
Convex programming (90C25) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items
Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization, Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints, Completely positive reformulations of polynomial optimization problems with linear constraints, Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures, Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems, Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems, 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 eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints, A robust Lagrangian-DNN method for a class of quadratic optimization problems, Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems, The CP-Matrix Approximation Problem, Polyhedral approximations of the semidefinite cone and their application, A semidefinite relaxation algorithm for checking completely positive separable matrices, An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs, Completely positive reformulations for polynomial optimization, A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
