Paper Citation Record · LEDGER

Global $o(1/k^2)$ Merit Complexity of Regularized Newton Methods for Convex Multiobjective Optimization

As of 11 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2606.30250.

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

pith.paper-citation-record.v1
2606.30250 v1

Coverage vector

measured 21 of 21 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-06-30T05:22:17.749980Z

measured 21 of 21 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

21 of 21 outbound references displayed

verified exact1
verified fuzzy0
unresolved20
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation f98b1320-c166-49e9-a787-a4176ca76326 · outbound

This paper cites Beck and M.

Global $o(1/k^2)$ Merit Complexity of Regularized Newton Methods for Convex Multiobjective Optimization Beck and M

Reference 1

Resolution: unresolved; no resolver link, observed 2026-06-30T05:22:17.749980Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2848c834-b14d-4f3a-bd9d-6825732c0d1f · outbound

This paper cites El Moudden and A.

Global $o(1/k^2)$ Merit Complexity of Regularized Newton Methods for Convex Multiobjective Optimization El Moudden and A

Reference 2

Resolution: unresolved; no resolver link, observed 2026-06-30T05:22:17.749980Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0029d0ba-a648-4ce9-bf42-5cca26e7de50 · outbound

This paper cites Fliege, L.

Global $o(1/k^2)$ Merit Complexity of Regularized Newton Methods for Convex Multiobjective Optimization Fliege, L

Reference 3

Resolution: unresolved; no resolver link, observed 2026-06-30T05:22:17.749980Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4dc6797c-1c4b-4027-9803-1bd4d65ffc9f · outbound

This paper cites Fliege and B.

Global $o(1/k^2)$ Merit Complexity of Regularized Newton Methods for Convex Multiobjective Optimization Fliege and B

Reference 4

Resolution: unresolved; no resolver link, observed 2026-06-30T05:22:17.749980Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cc03796c-d375-40e2-885b-1344153112e7 · outbound

This paper cites Fliege, A.

Global $o(1/k^2)$ Merit Complexity of Regularized Newton Methods for Convex Multiobjective Optimization Fliege, A

Reference 5

Resolution: unresolved; no resolver link, observed 2026-06-30T05:22:17.749980Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 674e6459-3e5c-45b5-97b7-1a4595ac1401 · outbound

This paper cites Ghosh,Cubic regularization technique of the Newton method for vector optimization, Journal of Optimization Theory and Applications, 207 (2025), p.

Global $o(1/k^2)$ Merit Complexity of Regularized Newton Methods for Convex Multiobjective Optimization Ghosh,Cubic regularization technique of the Newton method for vector optimization, Journal of Optimization Theory and Applications, 207 (2025), p

Reference 6

Resolution: unresolved; no resolver link, observed 2026-06-30T05:22:17.749980Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3f140e27-c3b9-49ca-9934-5f58b7cd7c59 · outbound

This paper cites an unresolved cited work.

Global $o(1/k^2)$ Merit Complexity of Regularized Newton Methods for Convex Multiobjective Optimization Unresolved cited work

Reference 7

Resolution: unresolved; no resolver link, observed 2026-06-30T05:22:17.749980Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e2c89a72-2d9e-4cfd-b6df-667dcee3c67e · outbound

This paper cites Mishchenko,Regularized Newton method with global O(1/k2)convergence, SIAM Journal on Optimization, 33 (2023), pp.

Global $o(1/k^2)$ Merit Complexity of Regularized Newton Methods for Convex Multiobjective Optimization Mishchenko,Regularized Newton method with global O(1/k2)convergence, SIAM Journal on Optimization, 33 (2023), pp

Reference 8

Resolution: unresolved; no resolver link, observed 2026-06-30T05:22:17.749980Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6483b250-a770-47cb-b670-45416ed80e94 · outbound

This paper cites Nesterov and B.

Global $o(1/k^2)$ Merit Complexity of Regularized Newton Methods for Convex Multiobjective Optimization Nesterov and B

Reference 9

Resolution: unresolved; no resolver link, observed 2026-06-30T05:22:17.749980Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 92491abb-a9b3-427f-8117-3015a0aec4d6 · outbound

This paper cites an unresolved cited work.

Global $o(1/k^2)$ Merit Complexity of Regularized Newton Methods for Convex Multiobjective Optimization Unresolved cited work

Reference 10

Resolution: unresolved; no resolver link, observed 2026-06-30T05:22:17.749980Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a92c61d5-0207-46ee-86aa-9793852fa588 · outbound

This paper cites an unresolved cited work.

Global $o(1/k^2)$ Merit Complexity of Regularized Newton Methods for Convex Multiobjective Optimization Unresolved cited work

Reference 11

Resolution: unresolved; no resolver link, observed 2026-06-30T05:22:17.749980Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 99775f97-ac84-4b5b-8df6-cc560e311748 · outbound

This paper cites an unresolved cited work.

Global $o(1/k^2)$ Merit Complexity of Regularized Newton Methods for Convex Multiobjective Optimization Unresolved cited work

Reference 12

Resolution: unresolved; no resolver link, observed 2026-06-30T05:22:17.749980Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b1c21f47-6262-4909-815d-186ea6a08c9f · outbound

This paper cites an unresolved cited work.

Global $o(1/k^2)$ Merit Complexity of Regularized Newton Methods for Convex Multiobjective Optimization Unresolved cited work

Reference 13

Resolution: unresolved; no resolver link, observed 2026-06-30T05:22:17.749980Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bcda5659-7fbe-4e13-b6ae-d3b610d686ef · outbound

This paper cites Sonntag and S.

Global $o(1/k^2)$ Merit Complexity of Regularized Newton Methods for Convex Multiobjective Optimization Sonntag and S

Reference 14

Resolution: unresolved; no resolver link, observed 2026-06-30T05:22:17.749980Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4c83d07b-3333-4346-ba2d-2f6e04699922 · outbound

This paper cites an unresolved cited work.

Global $o(1/k^2)$ Merit Complexity of Regularized Newton Methods for Convex Multiobjective Optimization Unresolved cited work

Reference 15

Resolution: unresolved; no resolver link, observed 2026-06-30T05:22:17.749980Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 02de4979-c239-4fee-82af-fc90fd5377f6 · outbound

This paper cites Tanabe, E.

Global $o(1/k^2)$ Merit Complexity of Regularized Newton Methods for Convex Multiobjective Optimization Tanabe, E

Reference 16

Resolution: unresolved; no resolver link, observed 2026-06-30T05:22:17.749980Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bd7c22c5-348d-46ba-aefc-47a80495db78 · outbound

This paper cites an unresolved cited work.

Global $o(1/k^2)$ Merit Complexity of Regularized Newton Methods for Convex Multiobjective Optimization Unresolved cited work

Reference 17

Resolution: unresolved; no resolver link, observed 2026-06-30T05:22:17.749980Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b5dfa182-75e8-4c42-ad78-c652d5acc5b3 · outbound

This paper cites an unresolved cited work.

Global $o(1/k^2)$ Merit Complexity of Regularized Newton Methods for Convex Multiobjective Optimization Unresolved cited work

Reference 18

Resolution: unresolved; no resolver link, observed 2026-06-30T05:22:17.749980Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2be2a420-48d4-4ffe-8533-ee4768c73714 · outbound

This paper cites 3821–3858.

Global $o(1/k^2)$ Merit Complexity of Regularized Newton Methods for Convex Multiobjective Optimization 3821–3858

Reference 19

Resolution: unresolved; no resolver link, observed 2026-06-30T05:22:17.749980Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cd075e1d-2e30-422d-9ceb-a641ece59e11 · outbound

This paper cites W ang and S.

Global $o(1/k^2)$ Merit Complexity of Regularized Newton Methods for Convex Multiobjective Optimization W ang and S

Reference 20

Resolution: unresolved; no resolver link, observed 2026-06-30T05:22:17.749980Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3c70087c-3b9f-42dd-bb1c-dfae0496bfaa · outbound

This paper cites The convergence rate of the accelerated proximal gradient algorithm for Multiobjective Optimization is faster than $O(1/k^2)$.

Global $o(1/k^2)$ Merit Complexity of Regularized Newton Methods for Convex Multiobjective Optimization The convergence rate of the accelerated proximal gradient algorithm for Multiobjective Optimization is faster than $O(1/k^2)$

Reference 21

Resolution: verified exact; arxiv_id, observed 2026-06-30T14:44:45.743893Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Pith citing papers

No inbound Pith citation observations are available.