Cita APA (7a ed.)

Pătraşcu, A., & Irofti, P. (2021). Complexity of Inexact Proximal Point Algorithm for minimizing convex functions with Holderian Growth.

Cita Chicago Style (17a ed.)

Pătraşcu, Andrei, y Paul Irofti. Complexity of Inexact Proximal Point Algorithm for Minimizing Convex Functions with Holderian Growth. 2021.

Cita MLA (9a ed.)

Pătraşcu, Andrei, y Paul Irofti. Complexity of Inexact Proximal Point Algorithm for Minimizing Convex Functions with Holderian Growth. 2021.