Paper Citation Record · LEDGER

Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness

As of 7 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 3 inbound Pith citation observations for arXiv:2508.01353.

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

pith.paper-citation-record.v1
2508.01353 v2

Coverage vector

measured 29 of 29 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-06T05:56:11.983916Z

measured 32 of 32 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 3 of 3 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: pith, observed 2026-06-30T20:05:04.712024Z

Reference resolution

29 of 29 outbound references displayed

verified exact2
verified fuzzy19
unresolved8
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 1a04562d-a5e5-4ec3-878a-9c53d42bfe7e · outbound

This paper cites A Breg- man forward-backward linesearch algorithm for nonconvex composite op- timization: Superlinear convergence to nonisolated local minima.

Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness A Breg- man forward-backward linesearch algorithm for nonconvex composite op- timization: Superlinear convergence to nonisolated local minima

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-06T05:56:11.657281Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5d1d235f-44b5-432f-894f-8bda49315abf · outbound

This paper cites an unresolved cited work.

Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness Unresolved cited work

Reference 2

Resolution: unresolved; raw_fallback, observed 2026-08-06T05:56:13.138362Z

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 c6f545cf-3091-4b29-aa69-53e9d0f6cc0b · outbound

This paper cites Bauschke, Jérôme Bolte, and Marc Teboulle.

Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness Bauschke, Jérôme Bolte, and Marc Teboulle

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T05:56:13.096628Z

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 a16006aa-400b-4ddd-b251-dab64231f4fc · outbound

This paper cites Bauschke and Jonathan M.

Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness Bauschke and Jonathan M

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-06T05:56:11.689700Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bd3742dc-428c-4397-890b-2991ba2e2533 · outbound

This paper cites Bauschke and Patrick L.

Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness Bauschke and Patrick L

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T05:56:13.031489Z

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 4a374ba7-5ce1-4a3a-9d0d-c61ec124faf2 · outbound

This paper cites First order methods beyond convexity and Lipschitz gradient continuity with applications toquadratic inverseproblems.SIAM Journal on Optimization, 28(3):2131–2151, 2018.

Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness First order methods beyond convexity and Lipschitz gradient continuity with applications toquadratic inverseproblems.SIAM Journal on Optimization, 28(3):2131–2151, 2018

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T05:56:12.992827Z

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 c2475d2b-d7d3-4cfd-bed2-857464c0456f · outbound

This paper cites Libsvm: A library for support vector machines.

Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness Libsvm: A library for support vector machines

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T05:56:12.963474Z

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 c045d3e1-c25a-4083-acf9-ff61788ede33 · outbound

This paper cites Convergence analysis of a proximal-like minimization algorithm using Bregman functions.SIAM Journal on Opti- mization, 3(3):538–543, 1993.

Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness Convergence analysis of a proximal-like minimization algorithm using Bregman functions.SIAM Journal on Opti- mization, 3(3):538–543, 1993

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-06T05:56:11.739026Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b0aceaa0-3ae7-4dea-997e-bc20e0f0e2f5 · outbound

This paper cites an unresolved cited work.

Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness Unresolved cited work

Reference 9

Resolution: verified exact; raw_fallback, observed 2026-08-06T05:56:12.302457Z

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 2949f4f0-a783-40d5-95d6-4dedcb1ffb17 · outbound

This paper cites Accelerated Bregman proxi- mal gradient methods for relatively smooth convex optimization.Compu- tational Optimization and Applications, 79(2):405–440, 2021.

Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness Accelerated Bregman proxi- mal gradient methods for relatively smooth convex optimization.Compu- tational Optimization and Applications, 79(2):405–440, 2021

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T05:56:12.903870Z

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 53fc2096-210b-43e5-8cb4-b88f3551c2ac · outbound

This paper cites On the conver- gence of adaptive first order methods: Proximal gradient and alternating minimization algorithms.

Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness On the conver- gence of adaptive first order methods: Proximal gradient and alternating minimization algorithms

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T05:56:12.869144Z

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 8624d067-3103-4559-b1de-b78dda8df8dc · outbound

This paper cites Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient.Mathematical Programming, 2024.

Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient.Mathematical Programming, 2024

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T05:56:12.833097Z

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 a96cda83-e100-4f04-8d96-d47ec8d9eb09 · outbound

This paper cites Asimpleuniformlyoptimalmethodwithout line search for convex optimization.Mathematical Programming, pages 1– 38, 2025.

Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness Asimpleuniformlyoptimalmethodwithout line search for convex optimization.Mathematical Programming, pages 1– 38, 2025

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T05:56:12.804900Z

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 e1d1726d-af75-49fd-a686-0cf78f2a75df · outbound

This paper cites Freund, and Yurii Nesterov.

Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness Freund, and Yurii Nesterov

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-06T05:56:11.804179Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 847468b0-d098-41bd-a98e-83d0bca89e0b · outbound

This paper cites Golden ratio algorithms for variational inequalities.Math- ematical Programming, 184(1):383–410, 2020.

Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness Golden ratio algorithms for variational inequalities.Math- ematical Programming, 184(1):383–410, 2020

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T05:56:12.746445Z

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 9e733031-be2e-4c99-a018-8a871dec56d1 · outbound

This paper cites Adaptive gradient descent without descent.

Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness Adaptive gradient descent without descent

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T05:56:12.711779Z

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 7bbcd656-2c6c-4be7-b163-d548396b29fa · outbound

This paper cites Adaptive proximal gradient method for convex optimization.

Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness Adaptive proximal gradient method for convex optimization

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T05:56:12.677560Z

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 c2df17bf-61c7-44fc-8515-cc52cbb092ce · outbound

This paper cites A method of solving a convex programming problem with convergence rate o(1/k2).

Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness A method of solving a convex programming problem with convergence rate o(1/k2)

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T05:56:12.636426Z

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 1bb0bfa3-2d97-4160-b09e-6dee7395d8d8 · outbound

This paper cites The symmetry coefficient of positively homogeneous functions.

Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness The symmetry coefficient of positively homogeneous functions

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T05:56:12.596307Z

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 ac96e70d-79d5-4087-8493-68b4ed89004a · outbound

This paper cites Adaptive proximal gradient methods are universal without approximation.

Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness Adaptive proximal gradient methods are universal without approximation

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T05:56:12.559324Z

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 72c8cde1-6ab0-4728-b8f1-ddb7f3d88c44 · outbound

This paper cites Safeguarding adaptive methods: Global convergence of Barzilai-Borwein and other stepsize choices.

Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness Safeguarding adaptive methods: Global convergence of Barzilai-Borwein and other stepsize choices

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T05:56:12.522378Z

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 ca06b6cd-f36f-407a-80be-23f461350b43 · outbound

This paper cites Rockafellar.Convex Analysis.

Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness Rockafellar.Convex Analysis

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T05:56:12.499973Z

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 eecd4cc3-eae9-4459-a839-b97dd894b518 · outbound

This paper cites Solodov and Benar F.

Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness Solodov and Benar F

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T05:56:12.470555Z

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 2892f6ac-b865-4f2d-b095-dc44e74f3252 · outbound

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

Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness An Adaptive and Parameter-Free Nesterov's Accelerated Gradient Method for Convex Optimization

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-06T05:56:11.926307Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0d0b3168-0a01-429b-9913-775fc09af71d · outbound

This paper cites Bregman-goldenratioalgorithmsfor variational inequalities.Journal of Optimization Theory and Applications, 199(3):993–1021, 2023.

Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness Bregman-goldenratioalgorithmsfor variational inequalities.Journal of Optimization Theory and Applications, 199(3):993–1021, 2023

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T05:56:12.428858Z

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 b60fcf26-bf5e-4eee-983a-d35da1a96eac · outbound

This paper cites Bauschke.

Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness Bauschke

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-06T05:56:11.953716Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b8dcd9dd-471b-4045-917c-c6b7b3645d3c · outbound

This paper cites Bregman level proximal subdifferentials and new characterizations of Bregman proximal operators.

Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness Bregman level proximal subdifferentials and new characterizations of Bregman proximal operators

Reference 27

Resolution: verified exact; local_arxiv, observed 2026-08-06T05:56:12.079917Z

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 8312ebb2-1a84-4056-948e-bb3b085943db · outbound

This paper cites an unresolved cited work.

Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness Unresolved cited work

Reference 28

Resolution: unresolved; raw_fallback, observed 2026-08-06T05:56:12.360031Z

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 f01d00f1-a44d-48d7-8fdf-b69235969c4e · outbound

This paper cites Adabb: Adaptive Barzilai- Borwein method for convex optimization.Mathematics of Operations Re- search, 2025.

Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness Adabb: Adaptive Barzilai- Borwein method for convex optimization.Mathematics of Operations Re- search, 2025

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T05:56:12.329581Z

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.

Pith citing papers

Observation b597f158-6dd4-4db2-aec2-acb52db01ec5 · inbound

Auto-Conditioned Frank-Wolfe Algorithms cites this paper.

Auto-Conditioned Frank-Wolfe Algorithms Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness

Reference 43

Resolution: verified exact; arxiv_id, observed 2026-06-08T02:03:44.434277Z

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 420edac5-87c3-42de-a5ca-64870448dd7c · inbound

Auto-Conditioned Frank-Wolfe Algorithms cites this paper.

Auto-Conditioned Frank-Wolfe Algorithms Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness

Reference 43

Resolution: verified exact; local_arxiv, observed 2026-06-30T20:05:04.713684Z

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 4897920e-2656-43a9-81e5-613a406f6ce0 · 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 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.