This paper proves that nonconvex quadratically constrained quadratic programs can be solved in polynomial time when their underlying graph is acyclic, provided the constraints satisfy a certain technical condition. We demonstrate this theory on optimal power-flow problems over tree networks.
No takes yet. Share an insight, caveat, or question.
Bose et al. (2015) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: