American Psychological Association 6th edition

Yang, Y. (2022). An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints. Numerical Algorithms, 1-38. https://doi.org/10.1007/s11075-022-01279-x

ISO-690 (author-date, English)

YANG, Yaguang, 2022. An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints. Numerical Algorithms. 19 März 2022. P. 1-38. DOI 10.1007/s11075-022-01279-x.

Modern Language Association 9th edition

Yang, Y. „An Efficient Arc-Search Interior-Point Algorithm for Convex Quadratic Programming With Box Constraints“. Numerical Algorithms, März 2022, S. 1-38, https://doi.org/10.1007/s11075-022-01279-x.

Mohr Siebeck - Recht (Deutsch - Österreich)

Yang, Yaguang: An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints, Numerical Algorithms 2022, 1-38.

Emerald - Harvard

Yang, Y. (2022), „An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints“, Numerical Algorithms, S. 1-38.

Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.