Pătraşcu, A., & Irofti, P. (2021). Complexity of Inexact Proximal Point Algorithm for minimizing convex functions with Holderian Growth.
Chicago Style (17th ed.) CitationPătraşcu, Andrei, and Paul Irofti. Complexity of Inexact Proximal Point Algorithm for Minimizing Convex Functions with Holderian Growth. 2021.
MLA (9th ed.) CitationPătraşcu, Andrei, and Paul Irofti. Complexity of Inexact Proximal Point Algorithm for Minimizing Convex Functions with Holderian Growth. 2021.
Warning: These citations may not always be 100% accurate.