An Approximation Method for Solving Nonconvex Quadratic Programming Problems

摘要

In this study, we propose an approximate solution for nonconvex Quadratic Programming Problem (QPP) in general form using the eigenvalues of the Hessian matrix. Here we don't consider any special conditions (such as positive definiteness or positive semi