American Psychological Association 6th edition

ZHANG, J. Z., LIU, G. S., & WANG, S. Y. (2004). A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints. Numerische Mathematik, 98(3), 539-558.

ISO-690 (author-date, English)

ZHANG, J. Z, LIU, G. S und WANG, S. Y, 2004. A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints. Numerische Mathematik. 1 Januar 2004. Vol. 98, no. 3, p. 539-558.

Modern Language Association 9th edition

ZHANG, J. Z., G. S. LIU, und S. Y. WANG. „A Globally Convergent Approximately Active Search Algorithm for Solving Mathematical Programs With Linear Complementarity Constraints“. Numerische Mathematik, Bd. 98, Nr. 3, Januar 2004, S. 539-58.

Mohr Siebeck - Recht (Deutsch - Österreich)

ZHANG, J. Z/LIU, G. S/WANG, S. Y: A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints, Numerische Mathematik 2004, 539-558.

Emerald - Harvard

ZHANG, J.Z., LIU, G.S. und WANG, S.Y. (2004), „A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints“, Numerische Mathematik, Vol. 98 No. 3, S. 539-558.

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