APA (7th ed.) Citation

Dussault, J., Frappier, M., & Gilbert, J. C. (2026). Polyhedral Newton-min algorithms for complementarity problems. Mathematical Programming, 215(1/2), 269. https://doi.org/10.1007/s10107-025-02219-y

Chicago Style (17th ed.) Citation

Dussault, Jean-Pierre, Mathieu Frappier, and Jean Charles Gilbert. "Polyhedral Newton-min Algorithms for Complementarity Problems." Mathematical Programming 215, no. 1/2 (2026): 269. https://doi.org/10.1007/s10107-025-02219-y.

MLA (9th ed.) Citation

Dussault, Jean-Pierre, et al. "Polyhedral Newton-min Algorithms for Complementarity Problems." Mathematical Programming, vol. 215, no. 1/2, 2026, p. 269, https://doi.org/10.1007/s10107-025-02219-y.

Warning: These citations may not always be 100% accurate.