APA (7th ed.) Citation

Gondzio, J., & Sobral, F. N. C. (2025). Polynomial worst-case iteration complexity of quasi-Newton primal-dual interior point algorithms for linear programming. Computational Optimization & Applications, 91(2), 649. https://doi.org/10.1007/s10589-024-00584-6

Chicago Style (17th ed.) Citation

Gondzio, Jacek, and Francisco N. C. Sobral. "Polynomial Worst-case Iteration Complexity of Quasi-Newton Primal-dual Interior Point Algorithms for Linear Programming." Computational Optimization & Applications 91, no. 2 (2025): 649. https://doi.org/10.1007/s10589-024-00584-6.

MLA (9th ed.) Citation

Gondzio, Jacek, and Francisco N. C. Sobral. "Polynomial Worst-case Iteration Complexity of Quasi-Newton Primal-dual Interior Point Algorithms for Linear Programming." Computational Optimization & Applications, vol. 91, no. 2, 2025, p. 649, https://doi.org/10.1007/s10589-024-00584-6.