Login / Signup
A new SOCP relaxation of nonconvex quadratic programming problems with a few negative eigenvalues.
Jing Zhou
Dongmei Zhang
Lin Wang
Zhijun Xu
Published in:
J. Comput. Appl. Math. (2023)
Keyphrases
</>
quadratic programming problems
convex optimization
convex relaxation
equality constraints
objective function
nonlinear programming
linear programming
systems of linear equations
support vector machine
globally optimal
optimization problems
interior point methods
primal dual
genetic algorithm
multi class
low rank