Lasserre, J., Toh, K., & Yang, S. (2017). A bounded degree SOS hierarchy for polynomial optimization. EURO journal on computational optimization, 5(1-2), 87-117. https://doi.org/10.1007/s13675-015-0050-y
Chicago-Zitierstil (17. Ausg.)Lasserre, JeanB, Kim-Chuan Toh, und Shouguang Yang. "A Bounded Degree SOS Hierarchy for Polynomial Optimization." EURO Journal on Computational Optimization 5, no. 1-2 (2017): 87-117. https://doi.org/10.1007/s13675-015-0050-y.
MLA-Zitierstil (9. Ausg.)Lasserre, JeanB, et al. "A Bounded Degree SOS Hierarchy for Polynomial Optimization." EURO Journal on Computational Optimization, vol. 5, no. 1-2, 2017, pp. 87-117, https://doi.org/10.1007/s13675-015-0050-y.
Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.