APA (7th ed.) Citation

Jian, J., Tang, C., Hu, Q., & Zheng, H. (2005). A feasible descent SQP algorithm for general constrained optimization without strict complementarity. Journal of computational and applied mathematics, 180(2), 391-412. https://doi.org/10.1016/j.cam.2004.11.008

Chicago Style (17th ed.) Citation

Jian, Jin-Bao, Chun-Ming Tang, Qing-Jie Hu, and Hai-Yan Zheng. "A Feasible Descent SQP Algorithm for General Constrained Optimization Without Strict Complementarity." Journal of Computational and Applied Mathematics 180, no. 2 (2005): 391-412. https://doi.org/10.1016/j.cam.2004.11.008.

MLA (9th ed.) Citation

Jian, Jin-Bao, et al. "A Feasible Descent SQP Algorithm for General Constrained Optimization Without Strict Complementarity." Journal of Computational and Applied Mathematics, vol. 180, no. 2, 2005, pp. 391-412, https://doi.org/10.1016/j.cam.2004.11.008.