A two-stage diagonalization and bisection algorithm is proposed for nonconvex QCQP with one equality constraint, claiming global optimality and O(N^3) complexity.
Eigenvalues and the max-cut prob- lem,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint
A two-stage diagonalization and bisection algorithm is proposed for nonconvex QCQP with one equality constraint, claiming global optimality and O(N^3) complexity.