Further development in convex conic reformulation of geometric nonconvex conic optimization problems

Kojima, Masakazu, Naohiko Arima, Sunyoung Kim

Publication date: 22 October 2024

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

quadratically constrained quadratic program polynomial optimization problem positive semidefinite cone convex conic reformulation exact semidefinite relaxation geometric conic optimization problem

Mathematics Subject Classification ID

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

Cites Work

Unnamed Item
Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization
Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
Quadratic maximization and semidefinite relaxation
Convexity of quadratic transformations and its use in control and optimization
An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
On the tightness of SDP relaxations of QCQPs
Completely positive reformulations for polynomial optimization
On the copositive representation of binary and continuous nonconvex quadratic programs
On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
Approximation of the Stability Number of a Graph via Copositive Programming
New Results on Quadratic Minimization
Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems
Exactness of Semidefinite Relaxations for Nonlinear Optimization Problems with Underlying Graph Structure
On the Closedness of the Linear Image of a Closed Convex Cone
A Copositive Programming Approach to Graph Partitioning
Convex Analysis
On Cones of Nonnegative Quadratic Functions
On copositive programming and standard quadratic optimization problems
Optimization under uncertainty and risk: quadratic and copositive approaches
Sparse conic reformulation of structured QCQPs based on copositive optimization with applications in stochastic optimization
Exact SDP relaxations for quadratic programs with bipartite graph structures
Necessary and Sufficient Conditions for Rank-One-Generated Cones

This page was built for publication: Further development in convex conic reformulation of geometric nonconvex conic optimization problems