Paper Citation Record · LEDGER

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

As of 8 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 1 inbound Pith citation observation for arXiv:2605.30502.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2605.30502 v1

Coverage vector

measured 34 of 34 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-06-29T05:41:02.043326Z

measured 35 of 35 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-07-14T02:28:43.704810Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

34 of 34 outbound references displayed

verified exact2
verified fuzzy0
unresolved32
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 83e1b2a6-6894-4373-9562-8bf6b67c0e20 · outbound

This paper cites A simple nearly optimal restart scheme for speeding up first-order methods.Found.

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead A simple nearly optimal restart scheme for speeding up first-order methods.Found

Reference 1

Resolution: unresolved; no resolver link, observed 2026-06-29T05:41:02.043326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1c004eb6-89f5-4306-b21c-70ba44154cbb · outbound

This paper cites Gradient methods for minimizing composite functions.Math.

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead Gradient methods for minimizing composite functions.Math

Reference 2

Resolution: unresolved; no resolver link, observed 2026-06-29T05:41:02.043326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 21657a18-fd11-4f01-8f5f-ca93fdaaed35 · outbound

This paper cites Adaptive restart for accelerated gradient schemes.Found.

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead Adaptive restart for accelerated gradient schemes.Found

Reference 3

Resolution: unresolved; no resolver link, observed 2026-06-29T05:41:02.043326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2233e884-ecbf-4c99-b60e-0f1c0ceb1fce · outbound

This paper cites an unresolved cited work.

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead Unresolved cited work

Reference 4

Resolution: unresolved; no resolver link, observed 2026-06-29T05:41:02.043326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4593217a-f3e0-4c45-aff5-072f21bda7b7 · outbound

This paper cites Sharpness, restart, and acceleration.SIAM J.

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead Sharpness, restart, and acceleration.SIAM J

Reference 5

Resolution: unresolved; no resolver link, observed 2026-06-29T05:41:02.043326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 168b9b45-b8fa-42c3-b64c-833fefd12635 · outbound

This paper cites Optimal methods of smooth convex minimization.USSR Computational Mathematics and Mathematical Physics, 25(2):21–30, 1985.

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead Optimal methods of smooth convex minimization.USSR Computational Mathematics and Mathematical Physics, 25(2):21–30, 1985

Reference 6

Resolution: unresolved; no resolver link, observed 2026-06-29T05:41:02.043326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 49cddeb1-6988-4d24-9077-3c4e43fb5941 · outbound

This paper cites From error bounds to the complexity of first-order descent methods for convex functions.Math.

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead From error bounds to the complexity of first-order descent methods for convex functions.Math

Reference 7

Resolution: unresolved; no resolver link, observed 2026-06-29T05:41:02.043326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 20138c76-b21d-4f01-997b-9690f45ff5b2 · outbound

This paper cites Monotonicity and restart in fast gradient methods.

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead Monotonicity and restart in fast gradient methods

Reference 8

Resolution: unresolved; no resolver link, observed 2026-06-29T05:41:02.043326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4ff0f49c-64bd-44be-9c32-a1098480575c · outbound

This paper cites Restarting accelerated gradient methods with a rough strong convexity estimate.

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead Restarting accelerated gradient methods with a rough strong convexity estimate

Reference 9

Resolution: verified exact; local_arxiv, observed 2026-06-29T05:43:07.919490Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation d60abdb5-0949-4e07-bfdc-1d468e04be53 · outbound

This paper cites Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems.SIAM J.

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems.SIAM J

Reference 10

Resolution: unresolved; no resolver link, observed 2026-06-29T05:41:02.043326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e4dc2277-797f-4335-980f-ab9969dfe233 · outbound

This paper cites Adaptive accelerated gradient converging method under Hölderian error bound condition.

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead Adaptive accelerated gradient converging method under Hölderian error bound condition

Reference 11

Resolution: unresolved; no resolver link, observed 2026-06-29T05:41:02.043326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ba129274-a7e2-4032-947d-2c7173acd42d · outbound

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

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead Adaptive restart of accelerated gradient methods under local quadratic growth condition.IMA Journal of Numerical Analysis, 39(4):2069–2095, 10 2019

Reference 12

Resolution: unresolved; no resolver link, observed 2026-06-29T05:41:02.043326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8faee97d-8a3a-4397-965f-87da0f378320 · outbound

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

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead Efficient parameter-free restarted accelerated gradient methods for convex and strongly convex optimization.J

Reference 13

Resolution: unresolved; no resolver link, observed 2026-06-29T05:41:02.043326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 050900a2-91c7-419c-ba18-cc8662097493 · outbound

This paper cites Rsg: Beating subgradient method without smoothness and strong convexity.J.

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead Rsg: Beating subgradient method without smoothness and strong convexity.J

Reference 14

Resolution: unresolved; no resolver link, observed 2026-06-29T05:41:02.043326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fddaff19-32aa-466b-a0ac-c17a5278e81c · outbound

This paper cites Stochastic algorithms with geometric step decay converge linearly on sharp functions.Math.

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead Stochastic algorithms with geometric step decay converge linearly on sharp functions.Math

Reference 15

Resolution: unresolved; no resolver link, observed 2026-06-29T05:41:02.043326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 455b59c1-4606-4311-a75b-86b6ca49f323 · outbound

This paper cites Practical large-scale linear programming using primal-dual hybrid gradient.

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead Practical large-scale linear programming using primal-dual hybrid gradient

Reference 16

Resolution: unresolved; no resolver link, observed 2026-06-29T05:41:02.043326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1ea2ebb0-13a5-4cc6-abc9-61d4bac0ba74 · outbound

This paper cites The Role of Level-Set Geometry on the Performance of PDHG for Conic Linear Optimization.

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead The Role of Level-Set Geometry on the Performance of PDHG for Conic Linear Optimization

Reference 17

Resolution: verified exact; arxiv_id, observed 2026-06-29T05:43:07.916945Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation ed2296dc-5654-4eba-ad21-065dc213df76 · outbound

This paper cites Pdlp: A practical first-order method for large-scale linear programming.Math.

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead Pdlp: A practical first-order method for large-scale linear programming.Math

Reference 18

Resolution: unresolved; no resolver link, observed 2026-06-29T05:41:02.043326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f67e3da2-c963-4a0c-b909-1189eff87f30 · outbound

This paper cites Parnes: a rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals.Numer.

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead Parnes: a rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals.Numer

Reference 19

Resolution: unresolved; no resolver link, observed 2026-06-29T05:41:02.043326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 77fe4519-c5d3-4db6-8edf-ada6e0a3a1f4 · outbound

This paper cites Restricted strong convexity and its applications to convergence analysis of gradient-type methods in convex optimization.Optimization Letters, 9(5):961–979, 2015.

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead Restricted strong convexity and its applications to convergence analysis of gradient-type methods in convex optimization.Optimization Letters, 9(5):961–979, 2015

Reference 20

Resolution: unresolved; no resolver link, observed 2026-06-29T05:41:02.043326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ee9c6054-1867-4f49-8ca6-7ccbb4d0210a · outbound

This paper cites New computationalguaranteesfor solving convex optimizationproblems with first order methods, via a function growth condition measure.Math.

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead New computationalguaranteesfor solving convex optimizationproblems with first order methods, via a function growth condition measure.Math

Reference 21

Resolution: unresolved; no resolver link, observed 2026-06-29T05:41:02.043326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation be9e9e7c-0610-4441-a2ae-939878153489 · outbound

This paper cites Linear convergence of first order methods for non-strongly convex optimization.Math.

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead Linear convergence of first order methods for non-strongly convex optimization.Math

Reference 22

Resolution: unresolved; no resolver link, observed 2026-06-29T05:41:02.043326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9934e3af-fbbc-4454-9a34-f6386b4d809a · outbound

This paper cites An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization.Comput.

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization.Comput

Reference 23

Resolution: unresolved; no resolver link, observed 2026-06-29T05:41:02.043326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e20af064-3bb2-4afd-9527-4173af64136f · outbound

This paper cites Colbrook, and Maksym Neyra-Nesterenko.

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead Colbrook, and Maksym Neyra-Nesterenko

Reference 24

Resolution: unresolved; no resolver link, observed 2026-06-29T05:41:02.043326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5d5067da-167a-4b42-8e71-6bed188e271d · outbound

This paper cites Nearly optimal first-order methods for convex optimization under gradient norm measure: An adaptive regularization approach.J.

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead Nearly optimal first-order methods for convex optimization under gradient norm measure: An adaptive regularization approach.J

Reference 25

Resolution: unresolved; no resolver link, observed 2026-06-29T05:41:02.043326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 27157f75-a7b8-40ef-951d-199b425ec223 · outbound

This paper cites A method for solving the convex programming problem with convergence rateO(1/k2).

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead A method for solving the convex programming problem with convergence rateO(1/k2)

Reference 26

Resolution: unresolved; no resolver link, observed 2026-06-29T05:41:02.043326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f96d21d1-3b87-44ef-b460-fac3c788e735 · outbound

This paper cites A fast iterative shrinkage-thresholding algorithm for linear inverse problems.SIAM Journal on Imaging Sciences, 2(1):183–202, 2009.

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead A fast iterative shrinkage-thresholding algorithm for linear inverse problems.SIAM Journal on Imaging Sciences, 2(1):183–202, 2009

Reference 27

Resolution: unresolved; no resolver link, observed 2026-06-29T05:41:02.043326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c27de9ba-6e86-45f5-abdb-46e048a45237 · outbound

This paper cites Smooth minimization of non-smooth functions.Math.

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead Smooth minimization of non-smooth functions.Math

Reference 28

Resolution: unresolved; no resolver link, observed 2026-06-29T05:41:02.043326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 10c20d84-0372-4d48-b4a0-3a43012131b1 · outbound

This paper cites Smoothing and first order methods: A unified framework.SIAM J.

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead Smoothing and first order methods: A unified framework.SIAM J

Reference 29

Resolution: unresolved; no resolver link, observed 2026-06-29T05:41:02.043326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 02ceecda-86f7-41ef-93d2-f9ebd2f5c791 · outbound

This paper cites Making sgd parameter-free.

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead Making sgd parameter-free

Reference 30

Resolution: unresolved; no resolver link, observed 2026-06-29T05:41:02.043326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fed636bb-c354-46db-ae71-5cc910635f7b · outbound

This paper cites The price of adaptivity in stochastic convex optimization.Math.

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead The price of adaptivity in stochastic convex optimization.Math

Reference 31

Resolution: unresolved; no resolver link, observed 2026-06-29T05:41:02.043326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9cb5d438-a8dd-4fe9-91b7-e0568799f660 · outbound

This paper cites Nemirovski and D.B.

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead Nemirovski and D.B

Reference 32

Resolution: unresolved; no resolver link, observed 2026-06-29T05:41:02.043326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 08b2ae44-52aa-4331-9814-1c9d5334f318 · outbound

This paper cites The proof of Proposition B.4 requires some technical lemmas, given in Appendix B.3.

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead The proof of Proposition B.4 requires some technical lemmas, given in Appendix B.3

Reference 33

Resolution: unresolved; no resolver link, observed 2026-06-29T05:41:02.043326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d6bb9b64-883e-47a7-afa1-ec04969cbed4 · outbound

This paper cites Note thatc0 > 1and b−a·c0 > 0, so ∑∞ k=0 exp ( −(b−a·c0)ck 0 ) is finite, which further implies ∑m−1 k=0 ϵa k+1 ϵb k =O ( 1 ϵb−a ).

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/\epsilon)$ Overhead Note thatc0 > 1and b−a·c0 > 0, so ∑∞ k=0 exp ( −(b−a·c0)ck 0 ) is finite, which further implies ∑m−1 k=0 ϵa k+1 ϵb k =O ( 1 ϵb−a )

Reference 34

Resolution: unresolved; no resolver link, observed 2026-06-29T05:41:02.043326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

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

Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness cites this paper.

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.