APA (7th ed.) Citation

Grimmer, B., & Li, D. (2025). Some primal-dual theory for subgradient methods for strongly convex optimization. Mathematical Programming, 214(1/2), 759. https://doi.org/10.1007/s10107-025-02201-8

Chicago Style (17th ed.) Citation

Grimmer, Benjamin, and Danlin Li. "Some Primal-dual Theory for Subgradient Methods for Strongly Convex Optimization." Mathematical Programming 214, no. 1/2 (2025): 759. https://doi.org/10.1007/s10107-025-02201-8.

MLA (9th ed.) Citation

Grimmer, Benjamin, and Danlin Li. "Some Primal-dual Theory for Subgradient Methods for Strongly Convex Optimization." Mathematical Programming, vol. 214, no. 1/2, 2025, p. 759, https://doi.org/10.1007/s10107-025-02201-8.

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