Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness | Paper Citation Record

Observation 010d9615-a538-4f1e-bae4-f2c45ca9b38c · outbound

This paper cites Nemirovsky and D.B.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Nemirovsky and D.B

Reference 1

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 80812b7c-f77b-4355-b734-cf7d8ab47d53 · outbound

This paper cites Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization.Mathematical Programming, 149(1):1–45, 2015.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization.Mathematical Programming, 149(1):1–45, 2015

Reference 2

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ec2d179c-1cbd-4a9a-bb67-9b55df0f8e88 · outbound

This paper cites Universal gradient methods for convex optimization problems.Mathematical Programming, 152(1):381–404, 2015.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Universal gradient methods for convex optimization problems.Mathematical Programming, 152(1):381–404, 2015

Reference 3

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 097a4566-c860-433d-b592-e19b938473bf · outbound

This paper cites A simple uniformly optimal method without line search for convex optimization.Mathematical Programming, 2025.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness A simple uniformly optimal method without line search for convex optimization.Mathematical Programming, 2025

Reference 4

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 57179c8d-0660-44c0-a211-27b1ed82fe84 · outbound

This paper cites The lojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems.SIAM Journal on Optimization, 17(4):1205–1223, 2007.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness The lojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems.SIAM Journal on Optimization, 17(4):1205–1223, 2007

Reference 5

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 912f3f1c-2025-4cf6-b0f5-595fc422e6bc · outbound

This paper cites Convex optimization: Algorithms and complexity.Foundations and Trends®in Machine Learning, 8(3-4):231–357, 2015.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Convex optimization: Algorithms and complexity.Foundations and Trends®in Machine Learning, 8(3-4):231–357, 2015

Reference 6

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 160f7c6f-16ec-41f5-a86c-4ea6b365af7a · outbound

This paper cites Universal complexity bounds for universal gradient methods in nonlinear optimization, 2025.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Universal complexity bounds for universal gradient methods in nonlinear optimization, 2025

Reference 7

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 637a8b37-e5e0-4000-adc5-b415ca54bfdb · outbound

This paper cites New variants of bundle methods.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness New variants of bundle methods

Reference 8

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 531f8556-6ac8-4797-830d-1a3f62e1485e · outbound

This paper cites Golden Ratio Algorithms for Variational Inequalities.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Golden Ratio Algorithms for Variational Inequalities

Reference 9

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5a6cd344-b5a3-42da-93bf-37baf66b8398 · outbound

This paper cites Adabb: Adaptive barzilai-borwein method for convex optimization.Mathematics of Operations Research, 51(1):715–745, 2026.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Adabb: Adaptive barzilai-borwein method for convex optimization.Mathematics of Operations Research, 51(1):715–745, 2026

Reference 10

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f51df9a8-62ef-4923-92b1-6e9b35a593bc · outbound

This paper cites An Adaptive and Parameter-Free Nesterov's Accelerated Gradient Method for Convex Optimization.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness An Adaptive and Parameter-Free Nesterov's Accelerated Gradient Method for Convex Optimization

Reference 11

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2b5c3f1b-dc3f-49a1-a068-83cb551afff8 · outbound

This paper cites Auto-conditioned primal-dual hybrid gradient method and alternating direction method of multipliers.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Auto-conditioned primal-dual hybrid gradient method and alternating direction method of multipliers

Reference 12

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f9e22197-d29c-43f7-8741-7d7bd7c5a59d · outbound

This paper cites Projected gradient methods for nonconvex and stochastic smooth optimization: new complexities and auto-conditioned stepsizes.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Projected gradient methods for nonconvex and stochastic smooth optimization: new complexities and auto-conditioned stepsizes

Reference 13

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 890ab74f-9ca3-47ac-9d4c-bfe25f01e53b · outbound

This paper cites Uniformly optimal and parameter-free first-order methods for convex and function-constrained optimization.INFORMS Journal on Computing, 2026.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Uniformly optimal and parameter-free first-order methods for convex and function-constrained optimization.INFORMS Journal on Computing, 2026

Reference 14

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 336819ad-e6af-4084-9385-94a477998581 · outbound

This paper cites Simple linesearch-free first-order methods for nonconvex optimization.arXiv preprint arXiv:2509.14670, 2025.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Simple linesearch-free first-order methods for nonconvex optimization.arXiv preprint arXiv:2509.14670, 2025

Reference 15

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b1f9c39f-1aa2-48bb-96a7-55e518a08905 · outbound

This paper cites A simple adaptive proximal gradient method for nonconvex optimization.arXiv preprint arXiv:2510.06079, 2025.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness A simple adaptive proximal gradient method for nonconvex optimization.arXiv preprint arXiv:2510.06079, 2025

Reference 16

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fe8ffa09-ea52-43bb-b2ef-df19cf84980e · outbound

This paper cites Auto-Conditioned Frank-Wolfe Algorithms.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Auto-Conditioned Frank-Wolfe Algorithms

Reference 17

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 866132f3-86f6-46d3-afd3-a9fa6f40b23c · outbound

This paper cites Stochastic Auto-conditioned Fast Gradient Methods with Optimal Rates.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Stochastic Auto-conditioned Fast Gradient Methods with Optimal Rates

Reference 18

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ee5974df-ca83-4749-8eaa-3df6a081e143 · outbound

This paper cites Universal and Parameter-free Gradient Sliding for Composite Optimization.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Universal and Parameter-free Gradient Sliding for Composite Optimization

Reference 19

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dd11c576-d90a-4549-917e-b1f6f05233ef · outbound

This paper cites Problem-Parameter-Free Decentralized Nonconvex Stochastic Optimization.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Problem-Parameter-Free Decentralized Nonconvex Stochastic Optimization

Reference 20

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation beff8048-984b-4cdb-adc0-e7124c25b11e · outbound

This paper cites Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization

Reference 21

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3e464d5a-3f4b-400e-b496-912185aef546 · outbound

This paper cites Universal subgradient and proximal bundle methods for convex and strongly convex hybrid composite optimization.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Universal subgradient and proximal bundle methods for convex and strongly convex hybrid composite optimization

Reference 22

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2153a497-2af4-4661-a315-6047d2b1d8bd · outbound

This paper cites Universal Gradient Methods for Stochastic Convex Optimization.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Universal Gradient Methods for Stochastic Convex Optimization

Reference 23

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4897920e-2656-43a9-81e5-613a406f6ce0 · outbound

This paper cites Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness

Reference 24

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3a98fe69-7eef-4437-b24c-8bb3b74a0648 · outbound

This paper cites Parameter-free accelerated gradient descent for nonconvex minimization.SIAM Journal on Optimization, 34(2):2093–2120, 2024.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Parameter-free accelerated gradient descent for nonconvex minimization.SIAM Journal on Optimization, 34(2):2093–2120, 2024

Reference 25

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7f928086-f1f0-45d0-89e2-2f5b400a73d7 · outbound

This paper cites Adaptive gradient descent without descent.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Adaptive gradient descent without descent

Reference 26

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9c66fc3b-0b43-489c-b0bc-354edb12cf58 · outbound

This paper cites Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization.Mathematical Programming, 2026.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization.Mathematical Programming, 2026

Reference 27

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 081f4542-572b-4f60-9a3b-96dea2553048 · outbound

This paper cites An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization.Computational Optimization and Applications, 60(3):633–674, 2015.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization.Computational Optimization and Applications, 60(3):633–674, 2015

Reference 28

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7116bb77-e151-4584-9548-942b797c54e4 · outbound

This paper cites Adaptive restart of accelerated gradient methods under local quadratic growth condition.IMA Journal of Numerical Analysis, 39(4):2069–2095, 2019.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Adaptive restart of accelerated gradient methods under local quadratic growth condition.IMA Journal of Numerical Analysis, 39(4):2069–2095, 2019

Reference 29

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d354634e-0ca4-498b-b252-e59b19b9a74d · outbound

This paper cites Adaptive accelerated gradient converging methods under H¨ olderian error bound condition.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Adaptive accelerated gradient converging methods under H¨ olderian error bound condition

Reference 30

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8c9908f5-54dd-4e0a-af50-4f3f21a9f1bd · outbound

This paper cites Sharpness, restart, and acceleration.SIAM Journal on Optimization, 30(1):262–289, 2020.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Sharpness, restart, and acceleration.SIAM Journal on Optimization, 30(1):262–289, 2020

Reference 31

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fe06f2ee-90e7-47a0-9180-e33066b00e36 · outbound

This paper cites A simple nearly-optimal restart scheme for speeding- up first order methods.Foundations of Computational Mathematics, 22(1):211–256, 2022.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness A simple nearly-optimal restart scheme for speeding- up first order methods.Foundations of Computational Mathematics, 22(1):211–256, 2022

Reference 32

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6084d4c2-7f21-41aa-b9af-29630d031684 · outbound

This paper cites Efficient parameter-free restarted accelerated gradient methods for convex and strongly convex optimization: A.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Efficient parameter-free restarted accelerated gradient methods for convex and strongly convex optimization: A

Reference 33

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4250574c-77b2-4354-92d1-ef48377af182 · outbound

This paper cites an unresolved cited work.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Unresolved cited work

Reference 34

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 51caff89-c5d4-4b0b-b425-a40da59a0b8d · outbound

This paper cites A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead

Reference 35

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation af6f45eb-5a5b-4bdf-9daa-fdee03387f36 · outbound

This paper cites Burke and Michael C.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Burke and Michael C

Reference 36

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 67eedbf2-123e-4e5a-80b2-c3fd717ae253 · outbound

This paper cites Generic minimizing behavior in semialgebraic optimization.SIAM Journal on Optimization, 26(1):513–534, 2016.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Generic minimizing behavior in semialgebraic optimization.SIAM Journal on Optimization, 26(1):513–534, 2016

Reference 37

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2687089b-7a97-479f-b25c-f3b852a979d3 · outbound

This paper cites an unresolved cited work.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Unresolved cited work

Reference 38

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 961408c4-5d01-42a9-8aa6-69be06d5b967 · outbound

This paper cites From error bounds to the complexity of first-order descent methods for convex functions.Mathematical Programming, 165(2):471–507, 2017.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness From error bounds to the complexity of first-order descent methods for convex functions.Mathematical Programming, 165(2):471–507, 2017

Reference 39

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e2422e61-913a-4fc8-9804-4fa2c4de32c1 · outbound

This paper cites Linear convergence of gradient and proximal- gradient methods under the polyak- lojasiewicz condition.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Linear convergence of gradient and proximal- gradient methods under the polyak- lojasiewicz condition

Reference 40

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 79444afe-d97f-42b8-8edb-4937722119b1 · outbound

This paper cites Gradient descent with adaptive stepsize converges (nearly) linearly under fourth-order growth: D.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Gradient descent with adaptive stepsize converges (nearly) linearly under fourth-order growth: D

Reference 41

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d7d71476-3aa1-4c5b-ae26-e9c41b902deb · outbound

This paper cites MacPhee, and Courtney Paquette.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness MacPhee, and Courtney Paquette

Reference 42

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7521413d-2e68-4ae8-9334-e8efe72164ef · outbound

This paper cites Stochastic algorithms with geometric step decay converge linearly on sharp functions.Mathematical Programming, 207(1):145–190, 2024.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Stochastic algorithms with geometric step decay converge linearly on sharp functions.Mathematical Programming, 207(1):145–190, 2024

Reference 43

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9e0ccbc5-24f6-429c-a25d-4b95972382d1 · outbound

This paper cites A superlinearly convergent subgradient method for sharp semismooth problems.Mathematics of Operations Research, 49(3):1678–1709, 2024.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness A superlinearly convergent subgradient method for sharp semismooth problems.Mathematics of Operations Research, 49(3):1678–1709, 2024

Reference 44

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f81294b5-1979-4672-9db6-ab90ce335188 · outbound

This paper cites Survey descent: A multipoint generalization of gradient descent for nonsmooth optimization.SIAM Journal on Optimization, 33(1):36–62, 2023.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Survey descent: A multipoint generalization of gradient descent for nonsmooth optimization.SIAM Journal on Optimization, 33(1):36–62, 2023

Reference 45

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ff1b8d8f-91d9-49a6-9c38-d0a8e355c137 · outbound

This paper cites A local nearly linearly convergent first-order method for nonsmooth functions with quadratic growth.Foundations of Computational Mathematics, 25(3):943–1024, 2025.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness A local nearly linearly convergent first-order method for nonsmooth functions with quadratic growth.Foundations of Computational Mathematics, 25(3):943–1024, 2025

Reference 46

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 54d7e3a9-90d3-416a-91c3-f3efcdc2b178 · outbound

This paper cites Lipschitz minimization and the goldstein modulus: S.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Lipschitz minimization and the goldstein modulus: S

Reference 47

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f2df2f9c-cf3d-4f3a-9485-491485d70129 · outbound

This paper cites Subgradient Regularization: A Descent-Oriented Subgradient Method for Nonsmooth Optimization.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Subgradient Regularization: A Descent-Oriented Subgradient Method for Nonsmooth Optimization

Reference 48

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c74d5c47-bd34-4d59-b317-6bbada407cde · outbound

This paper cites Linearly Convergent Algorithms for Nonsmooth Problems with Unknown Smooth Pieces.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Linearly Convergent Algorithms for Nonsmooth Problems with Unknown Smooth Pieces

Reference 49

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fd14b02e-4fec-4b21-892b-995726864822 · outbound

This paper cites Accelerated Prox-Level Methods for Unknown Piecewise-Smooth Optimization I: Convex Optimization.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Accelerated Prox-Level Methods for Unknown Piecewise-Smooth Optimization I: Convex Optimization

Reference 50

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 13d3c675-a10c-4715-90d2-6de37e7dcb1e · outbound

This paper cites Springer, 2020.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Springer, 2020

Reference 51

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7a79a6ce-b8db-4380-bce5-857510c015d5 · outbound

This paper cites Dual subgradient algorithms for large- scale nonsmooth learning problems.Mathematical Programming, 148(1-2):143–180, December 2014.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Dual subgradient algorithms for large- scale nonsmooth learning problems.Mathematical Programming, 148(1-2):143–180, December 2014

Reference 52

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f3d23c75-a184-46c5-b0e9-dca8b228065f · outbound

This paper cites Springer Science & Business Media, 2003.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Springer Science & Business Media, 2003

Reference 53

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 28f32cff-9d33-45d8-92fe-ccfcbc8d77a4 · outbound

This paper cites Lower complexity bounds for minimizing regularized functions.Optimization Letters, 19(9):1759–1778, 2025.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Lower complexity bounds for minimizing regularized functions.Optimization Letters, 19(9):1759–1778, 2025

Reference 54

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d26bafff-2018-45af-8e69-18fe05b37503 · outbound

This paper cites General Holder Smooth Convergence Rates Follow From Specialized Rates Assuming Growth Bounds.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness General Holder Smooth Convergence Rates Follow From Specialized Rates Assuming Growth Bounds

Reference 55

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3f30fd27-c506-44e8-80cd-81aa000fa17c · outbound

This paper cites Linearly convergent algorithms for nonsmooth problems with unknown smooth pieces, 2025.

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness Linearly convergent algorithms for nonsmooth problems with unknown smooth pieces, 2025

Reference 56

Resolution: unresolved; no resolver link, observed 2026-07-14T02:28:43.704810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Coverage vector

Reference resolution

Outbound references

Pith citing papers