## Further Development in Convex Conic Reformulation of Geometric Nonconvex Conic Optimization Problems

\(\) A geometric nonconvex conic optimization problem (COP) was recently proposed by Kim, Kojima and Toh asa unified framework for convex conic reformulation of a class of quadratic optimization problems and polynomial optimization problems. The nonconvex COP minimizes a linear function over the intersection of a nonconvex cone K, a convex subcone J of the … Read more