APA (7th ed.) Citation

Armand, P., Gilbert, J. C., & Jan, S. (2002). A BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approach. Mathematical programming, 92(3), 393-424. https://doi.org/10.1007/s101070100283

Chicago Style (17th ed.) Citation

Armand, Paul, Jean Charles Gilbert, and Sophie Jan. "A BFGS-IP Algorithm for Solving Strongly Convex Optimization Problems with Feasibility Enforced by an Exact Penalty Approach." Mathematical Programming 92, no. 3 (2002): 393-424. https://doi.org/10.1007/s101070100283.

MLA (9th ed.) Citation

Armand, Paul, et al. "A BFGS-IP Algorithm for Solving Strongly Convex Optimization Problems with Feasibility Enforced by an Exact Penalty Approach." Mathematical Programming, vol. 92, no. 3, 2002, pp. 393-424, https://doi.org/10.1007/s101070100283.