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. https://doi.org/10.1007/s00211-004-0542-9
Chicago Style (17th ed.) CitationZhang, J. Z., G. S. Liu, and S. Y. Wang. "A Globally Convergent Approximately Active Search Algorithm for Solving Mathematical Programs with Linear Complementarity Constraints." Numerische Mathematik 98, no. 3 (2004): 539-558. https://doi.org/10.1007/s00211-004-0542-9.
MLA (9th ed.) CitationZhang, J. Z., et al. "A Globally Convergent Approximately Active Search Algorithm for Solving Mathematical Programs with Linear Complementarity Constraints." Numerische Mathematik, vol. 98, no. 3, 2004, pp. 539-558, https://doi.org/10.1007/s00211-004-0542-9.