We utilize projected gradient method (PGM for short) to solve quadratic optimization problem
with spherical constraint. Based on the global convergence of simple first order conic …

This paper first proposes a new and enhanced second order cone programming relaxation
using the simultaneous matrix diagonalization technique for the linearly constrained …

This paper proposes a novel quadratic convex reformulation (QCR) for the nonconvex
quadratic program with convex quadratic constraints. This new QCR is based on the …

We present a new second order cone programming (SOCP) relaxation of nonconvex
quadratic programs with a few negative eigenvalues (NQP-r-NE) by employing the …

This paper proposes a novel second‐order cone programming (SOCP) relaxation for a
quadratic program with one quadratic constraint and several linear constraints (QCQP) that …