APA (7th ed.) Citation

Teboulle, M., & Vaisbourd, Y. (2023). An elementary approach to tight worst case complexity analysis of gradient based methods. Mathematical programming, 201(1-2), 63-96. https://doi.org/10.1007/s10107-022-01899-0

Chicago Style (17th ed.) Citation

Teboulle, Marc, and Yakov Vaisbourd. "An Elementary Approach to Tight Worst Case Complexity Analysis of Gradient Based Methods." Mathematical Programming 201, no. 1-2 (2023): 63-96. https://doi.org/10.1007/s10107-022-01899-0.

MLA (9th ed.) Citation

Teboulle, Marc, and Yakov Vaisbourd. "An Elementary Approach to Tight Worst Case Complexity Analysis of Gradient Based Methods." Mathematical Programming, vol. 201, no. 1-2, 2023, pp. 63-96, https://doi.org/10.1007/s10107-022-01899-0.