Zhu, Z. (2005). A globally and superlinearly convergent feasible QP-free method for nonlinear programming. Applied mathematics and computation, 168(1), 519-539. https://doi.org/10.1016/j.amc.2004.09.034
Chicago Style (17th ed.) CitationZhu, Zhibin. "A Globally and Superlinearly Convergent Feasible QP-free Method for Nonlinear Programming." Applied Mathematics and Computation 168, no. 1 (2005): 519-539. https://doi.org/10.1016/j.amc.2004.09.034.
MLA (9th ed.) CitationZhu, Zhibin. "A Globally and Superlinearly Convergent Feasible QP-free Method for Nonlinear Programming." Applied Mathematics and Computation, vol. 168, no. 1, 2005, pp. 519-539, https://doi.org/10.1016/j.amc.2004.09.034.
Warning: These citations may not always be 100% accurate.