APA (7th ed.) Citation

Ai, W., Liang, W., & Yuan, J. (2025). On the tightness of an SDP relaxation for homogeneous QCQP with three real or four complex homogeneous constraints. Mathematical Programming, 211(1), 5. https://doi.org/10.1007/s10107-024-02105-z

Chicago Style (17th ed.) Citation

Ai, Wenbao, Wei Liang, and Jianhua Yuan. "On the Tightness of an SDP Relaxation for Homogeneous QCQP with Three Real or Four Complex Homogeneous Constraints." Mathematical Programming 211, no. 1 (2025): 5. https://doi.org/10.1007/s10107-024-02105-z.

MLA (9th ed.) Citation

Ai, Wenbao, et al. "On the Tightness of an SDP Relaxation for Homogeneous QCQP with Three Real or Four Complex Homogeneous Constraints." Mathematical Programming, vol. 211, no. 1, 2025, p. 5, https://doi.org/10.1007/s10107-024-02105-z.