Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities | Paper Citation Record

Observation 6751dfe0-1cae-4c8c-be37-b6d77fb4472a · outbound

This paper cites Optimal Methods for Higher-Order Smooth Monotone Variational Inequalities.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Optimal Methods for Higher-Order Smooth Monotone Variational Inequalities

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-14T04:48:52.226992Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f8b72d3d-a5a6-424c-928f-a65e84e6ce44 · outbound

This paper cites Lower bounds for higher-order convex optimization.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Lower bounds for higher-order convex optimization

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:48:53.081398Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 3d5186ae-59d8-4dce-b4a3-f6cac05ea11e · outbound

This paper cites an unresolved cited work.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Unresolved cited work

Reference 3

Resolution: unresolved; raw_fallback, observed 2026-08-14T04:48:53.071643Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 16ad43aa-fdd8-4a68-8e56-c260523715ab · outbound

This paper cites Optimal black-box reductions between optimization objectives.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Optimal black-box reductions between optimization objectives

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:48:53.061901Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 01d65b41-f393-456f-9337-00cd6e6d8941 · outbound

This paper cites Marques Alves and Benar F.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Marques Alves and Benar F

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:48:53.052399Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 11e06a67-843e-4580-88da-dbaa4e495c00 · outbound

This paper cites Oracle complexity of second-order methods for smooth convex optimization.Mathematical Programming, 178(1):327–360, 2019.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Oracle complexity of second-order methods for smooth convex optimization.Mathematical Programming, 178(1):327–360, 2019

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-14T04:48:52.250121Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a8ef53db-2a20-4590-b951-dc8434cadf87 · outbound

This paper cites Doubly optimal no-regret online learning in strongly monotone games with bandit feedback.Operations Research, 73(6):3219–3244, 2025.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Doubly optimal no-regret online learning in strongly monotone games with bandit feedback.Operations Research, 73(6):3219–3244, 2025

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:48:53.036964Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation e2c52b43-bf74-4bef-a64a-b26ef15f51ab · outbound

This paper cites Near-optimal method for highly smooth convex optimization.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Near-optimal method for highly smooth convex optimization

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-14T04:48:52.257958Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2230f036-9414-42e2-8fb1-4fa1b7d5b3cb · outbound

This paper cites an unresolved cited work.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Unresolved cited work

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-14T04:48:52.261563Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dc8333c9-910b-4ccf-9be4-708159631591 · outbound

This paper cites Variance reduced halpern iteration for finite-sum monotone inclusions.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Variance reduced halpern iteration for finite-sum monotone inclusions

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:48:53.014747Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 821ad6e1-e363-476d-b924-a2df923c8fc2 · outbound

This paper cites Accelerated single-call methods for constrained min-max optimization.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Accelerated single-call methods for constrained min-max optimization

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:48:53.004944Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 42d27d12-5964-472a-a786-3508de52dae2 · outbound

This paper cites Finite-time last-iterate convergence for learning in multi-player games.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Finite-time last-iterate convergence for learning in multi-player games

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-14T04:48:52.274420Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 91b9cf0e-f254-4a4e-a51f-7933b28238bd · outbound

This paper cites Accelerated algorithms for constrained nonconvex- noncancave min-max optimization and comonotone inclusion.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Accelerated algorithms for constrained nonconvex- noncancave min-max optimization and comonotone inclusion

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:48:52.989597Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 786db073-0ee3-4a61-ae5c-650434f9c265 · outbound

This paper cites Distributionally robust optimization via ball oracle acceleration.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Distributionally robust optimization via ball oracle acceleration

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-14T04:48:52.281850Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d7621a83-59e8-4af4-aa97-cc2a693f8af7 · outbound

This paper cites Optimal and adaptive monteiro-svaiter acceleration.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Optimal and adaptive monteiro-svaiter acceleration

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-14T04:48:52.286053Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fc880f0c-9fe6-4283-8992-2320715cb709 · outbound

This paper cites Cambridge university press, 2006.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Cambridge university press, 2006

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-14T04:48:52.289650Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 582c6eb1-ed76-4a1c-a8d4-a55fdffaf801 · outbound

This paper cites Near-optimal algorithms for making the gradient small in stochastic minimax optimization.JMLR, 25(387):1–44, 2024.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Near-optimal algorithms for making the gradient small in stochastic minimax optimization.JMLR, 25(387):1–44, 2024

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:48:52.961719Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation b467d901-6d10-488e-bf0f-d75bd0e2bd39 · outbound

This paper cites Solving convex-concave problems with O(ϵ−4/7)second-order oracle complexity.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Solving convex-concave problems with O(ϵ−4/7)second-order oracle complexity

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-14T04:48:52.297292Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f0d6b584-f92d-43a3-b077-76576f864069 · outbound

This paper cites Solving Convex-Concave Problems with $\tilde{\mathcal{O}}(\epsilon^{-4/(3p+1)})$ $p$th-Order Oracle Complexity.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Solving Convex-Concave Problems with $\tilde{\mathcal{O}}(\epsilon^{-4/(3p+1)})$ $p$th-Order Oracle Complexity

Reference 19

Resolution: verified exact; local_arxiv, observed 2026-08-14T04:48:52.541021Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation b36f62ab-3936-4540-ab45-2a3d01fdc0f2 · outbound

This paper cites Monotone operator theory in convex optimization: Pl combettes.Mathematical Programming, 170(1):177–206, 2018.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Monotone operator theory in convex optimization: Pl combettes.Mathematical Programming, 170(1):177–206, 2018

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:48:52.942479Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 9615faf5-86cb-4fe9-a4b8-ef55f586c96b · outbound

This paper cites Fast linear algebra is stable.Numerische Mathematik, 108(1):59–91, 2007.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Fast linear algebra is stable.Numerische Mathematik, 108(1):59–91, 2007

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:48:52.931538Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation cb5fd2a5-c100-431c-b7b6-fd178b1a20dc · outbound

This paper cites Halpern iteration for near-optimal and parameter-free monotone inclusion and strong solutions to variational inequalities.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Halpern iteration for near-optimal and parameter-free monotone inclusion and strong solutions to variational inequalities

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:48:52.919428Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation d87fbbbf-34c7-4fa1-a75e-410f28b7f68e · outbound

This paper cites Faster matrix multiplication via asymmetric hashing.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Faster matrix multiplication via asymmetric hashing

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:48:52.906096Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 3fa4d584-ecd7-4803-bc83-8115f95fefa6 · outbound

This paper cites Springer, 2003.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Springer, 2003

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-14T04:48:52.320095Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2526c670-392f-40a4-9ec9-ca65fd7b8584 · outbound

This paper cites Near-optimal lower bounds for convex optimization for all orders of smoothness.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Near-optimal lower bounds for convex optimization for all orders of smoothness

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:48:52.888089Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation c39f46b2-b5d0-4dbd-a9df-4586b5d05ace · outbound

This paper cites Optimal tensor methods in smooth convex and uniformly convexoptimization.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Optimal tensor methods in smooth convex and uniformly convexoptimization

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-14T04:48:52.327846Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d91c81ba-e442-4706-a90f-68a903e0069e · outbound

This paper cites Springer, 1995.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Springer, 1995

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:48:52.870566Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 7cd89899-0532-4eba-ab5c-50e310ccc473 · outbound

This paper cites Generative adversarial networks.Communications of the ACM, 63(11): 139–144, 2020.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Generative adversarial networks.Communications of the ACM, 63(11): 139–144, 2020

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-14T04:48:52.335163Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0e467dcc-726a-4e3e-acbd-f654b710d173 · outbound

This paper cites Fixed points of nonexpanding maps.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Fixed points of nonexpanding maps

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-14T04:48:52.339964Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a784532a-15bb-42f7-bc52-d25397834e51 · outbound

This paper cites On some non-linear elliptic differential-functional equations.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities On some non-linear elliptic differential-functional equations

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:48:52.849030Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 39c4babd-a939-4ccd-b938-f29564d43e6c · outbound

This paper cites An approximation-based regularized extra-gradient method for monotone variational inequalities.SIAM Journal on Optimization, 35(3):1469–1497, 2025.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities An approximation-based regularized extra-gradient method for monotone variational inequalities.SIAM Journal on Optimization, 35(3):1469–1497, 2025

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-14T04:48:52.347189Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 56f44cbb-f82b-407d-9e70-c7cbc94bef34 · outbound

This paper cites An optimal high-order tensor method for convex optimization.Mathematics of Operations Research, 46(4):1390–1412, 2021.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities An optimal high-order tensor method for convex optimization.Mathematics of Operations Research, 46(4):1390–1412, 2021

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:48:52.831707Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 03226114-d0e1-4552-b3e2-b1c2e21e65e7 · outbound

This paper cites An improved cutting plane method for convex optimization, convex-concave games, and its applications.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities An improved cutting plane method for convex optimization, convex-concave games, and its applications

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-14T04:48:52.354566Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d38432af-03ce-4a87-94e6-a2501baf2d5e · outbound

This paper cites Generalized optimistic methods for convex-concave saddle point problems.SIAM Journal on Optimization, 35(3):2066–2097, 2025.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Generalized optimistic methods for convex-concave saddle point problems.SIAM Journal on Optimization, 35(3):2066–2097, 2025

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:48:52.813914Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 5d420d32-89ed-404b-aa86-c49ca2b1a915 · outbound

This paper cites Adaptive and optimal second-order optimistic methods for minimax optimization.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Adaptive and optimal second-order optimistic methods for minimax optimization

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-14T04:48:52.362164Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3f240907-7ca1-4ae9-b3f4-aee3ca064dde · outbound

This paper cites Adaptive, doubly optimal no-regret learning in strongly monotone and exp-concave games with gradient feedback.Operations Research, 73(3):1675–1702, 2025.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Adaptive, doubly optimal no-regret learning in strongly monotone and exp-concave games with gradient feedback.Operations Research, 73(3):1675–1702, 2025

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:48:52.795839Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 2e0e4609-1757-4892-8a46-c8b5444afab5 · outbound

This paper cites An introduction to variational inequalities and their applications.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities An introduction to variational inequalities and their applications

Reference 37

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:48:52.784284Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 2a52b7d0-40bc-4481-ae2f-a50c10def9f1 · outbound

This paper cites The extragradient method for finding saddle points and other problems.Matecon, 12:747–756, 1976.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities The extragradient method for finding saddle points and other problems.Matecon, 12:747–756, 1976

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-14T04:48:52.374400Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 27c8628e-31ab-4c87-9ddf-c76820adc3d5 · outbound

This paper cites The first optimal acceleration of high-order methods in smooth convex optimization.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities The first optimal acceleration of high-order methods in smooth convex optimization

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-14T04:48:52.378003Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 241d9968-b2dc-42dd-acdd-4fb6192603f1 · outbound

This paper cites Fast extra gradient methods for smooth structured nonconvex- nonconcave minimax problems.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Fast extra gradient methods for smooth structured nonconvex- nonconcave minimax problems

Reference 40

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:48:52.759649Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 52f6c246-0af5-4952-9051-84607ea45cdb · outbound

This paper cites On the convergence rate of the halpern-iteration.Optimization letters, 15(2):405–418, 2020.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities On the convergence rate of the halpern-iteration.Optimization letters, 15(2):405–418, 2020

Reference 41

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:48:52.746718Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 2c7427bd-1bd5-4542-ac6f-eaaea92f5b7d · outbound

This paper cites Monotone inclusions, acceleration, and closed-loop control.Mathematics of Operations Research, 48(4):2353–2382, 2023.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Monotone inclusions, acceleration, and closed-loop control.Mathematics of Operations Research, 48(4):2353–2382, 2023

Reference 42

Resolution: unresolved; no resolver link, observed 2026-08-14T04:48:52.389138Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f1287e5f-8995-4733-b8df-375bc4e0afc0 · outbound

This paper cites an unresolved cited work.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Unresolved cited work

Reference 43

Resolution: unresolved; no resolver link, observed 2026-08-14T04:48:52.392748Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1bdec612-f3b8-4d6a-8f09-62ecfb3c4411 · outbound

This paper cites Monotone (nonlinear) operators in hilbert space.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Monotone (nonlinear) operators in hilbert space

Reference 44

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:48:52.721890Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 264768f8-2e09-4894-8713-630568765150 · outbound

This paper cites A unified analysis of extra-gradient and optimistic gradient methods for saddle point problems: Proximal point approach.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities A unified analysis of extra-gradient and optimistic gradient methods for saddle point problems: Proximal point approach

Reference 45

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:48:52.710693Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation e16336c3-b205-4324-a02d-f50d7424cfc8 · outbound

This paper cites Iteration-complexity of a newton proximal extragradient method for monotone variational inequalities and inclusion problems.SIAM Journal on Optimization, 22(3):914–935, 2012.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Iteration-complexity of a newton proximal extragradient method for monotone variational inequalities and inclusion problems.SIAM Journal on Optimization, 22(3):914–935, 2012

Reference 46

Resolution: unresolved; no resolver link, observed 2026-08-14T04:48:52.403763Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 261718dc-9060-45f5-b39f-c6a86e55071c · outbound

This paper cites An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods.SIAM Journal on Optimization, 23 (2):1092–1125, 2013.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods.SIAM Journal on Optimization, 23 (2):1092–1125, 2013

Reference 47

Resolution: unresolved; no resolver link, observed 2026-08-14T04:48:52.407357Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 40081a6b-1444-4d52-9567-78721d1824e3 · outbound

This paper cites an unresolved cited work.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Unresolved cited work

Reference 48

Resolution: unresolved; raw_fallback, observed 2026-08-14T04:48:52.687356Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 7a79c995-b8a3-45c7-9977-8ee2c1812fb6 · outbound

This paper cites Problem complexity and method efficiency in optimization.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Problem complexity and method efficiency in optimization

Reference 49

Resolution: unresolved; no resolver link, observed 2026-08-14T04:48:52.414929Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8be7eda2-78b8-434f-b600-dc0773b7fd28 · outbound

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

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities A method for solving the convex programming problem with convergence rateO(1/k2)

Reference 50

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:48:52.669663Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 7edc0a7e-8307-48bf-9106-a9e09cb35149 · outbound

This paper cites Dual extrapolation and its applications to solving variational inequalities and related problems.Mathematical Programming, 109(2-3):319–344, 2007.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Dual extrapolation and its applications to solving variational inequalities and related problems.Mathematical Programming, 109(2-3):319–344, 2007

Reference 51

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:48:52.656814Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation c2702443-bd4f-4dde-b83e-36bc52e316f1 · outbound

This paper cites Accelerating the cubic regularization of newton’s method on convex problems.Mathe- matical Programming, 112(1):159–181, 2008.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Accelerating the cubic regularization of newton’s method on convex problems.Mathe- matical Programming, 112(1):159–181, 2008

Reference 52

Resolution: unresolved; no resolver link, observed 2026-08-14T04:48:52.426274Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6c04920b-bbd3-4211-9f37-153df2770cd2 · outbound

This paper cites Lectures on convex optimization.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Lectures on convex optimization

Reference 53

Resolution: unresolved; no resolver link, observed 2026-08-14T04:48:52.430127Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1d13b401-4551-40eb-a193-d4e4c39bced3 · outbound

This paper cites High-Order Reduced-Gradient Methods for Composite Variational Inequalities.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities High-Order Reduced-Gradient Methods for Composite Variational Inequalities

Reference 54

Resolution: unresolved; no resolver link, observed 2026-08-14T04:48:52.433933Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4b65352b-7f49-4473-82ee-0c71a6c1f41a · outbound

This paper cites Cubic regularization of newton method and its global performance.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Cubic regularization of newton method and its global performance

Reference 55

Resolution: unresolved; no resolver link, observed 2026-08-14T04:48:52.438170Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2c2f0b53-96e3-4c24-9b17-4e446366fc5d · outbound

This paper cites Numerical optimization.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Numerical optimization

Reference 56

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:48:52.627877Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 03e73654-a56a-4a70-a153-6d524f4dbf88 · outbound

This paper cites Tensor methods for strongly convex strongly concave saddle point problems and strongly monotone variational inequalities.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Tensor methods for strongly convex strongly concave saddle point problems and strongly monotone variational inequalities

Reference 57

Resolution: unresolved; no resolver link, observed 2026-08-14T04:48:52.445327Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1c493fb5-d56c-4122-b6ea-b37e8e3b3383 · outbound

This paper cites Smoothing functions and smoothing newton method for complementarity and variational inequality problems.Journal of Optimization Theory and Applications, 113:121–147, 2002.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Smoothing functions and smoothing newton method for complementarity and variational inequality problems.Journal of Optimization Theory and Applications, 113:121–147, 2002

Reference 58

Resolution: unresolved; no resolver link, observed 2026-08-14T04:48:52.449384Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5e3729d7-7c9a-4c7f-8c04-7d840cfb9345 · outbound

This paper cites Superlinear convergence of an interior-point method despite dependent constraints.Mathematics of Operations Research, 25(2):179–194, 2000.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Superlinear convergence of an interior-point method despite dependent constraints.Mathematics of Operations Research, 25(2):179–194, 2000

Reference 59

Resolution: unresolved; no resolver link, observed 2026-08-14T04:48:52.453022Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7a0deacd-fd27-40e3-9efe-c3e6d910d4c2 · outbound

This paper cites Tyrrell Rockafellar.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Tyrrell Rockafellar

Reference 60

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:48:52.602016Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation b63b472b-6e15-4f8f-a246-08e69d2cb606 · outbound

This paper cites Ryu and Stephen Boyd.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Ryu and Stephen Boyd

Reference 61

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:48:52.590027Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation c0f45aec-8c72-42d0-b3cd-b79c5aab2530 · outbound

This paper cites ODE Analysis of Stochastic Gradient Methods with Optimism and Anchoring for Minimax Problems.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities ODE Analysis of Stochastic Gradient Methods with Optimism and Anchoring for Minimax Problems

Reference 62

Resolution: unresolved; no resolver link, observed 2026-08-14T04:48:52.464760Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5e9d48f6-b951-4d0f-96f4-a04192a254e9 · outbound

This paper cites Stochastic online auc maximization.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Stochastic online auc maximization

Reference 63

Resolution: unresolved; no resolver link, observed 2026-08-14T04:48:52.468629Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ffab9f99-944d-4132-ac62-1b1a31bb558e · outbound

This paper cites an unresolved cited work.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Unresolved cited work

Reference 64

Resolution: unresolved; raw_fallback, observed 2026-08-14T04:48:52.572492Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 39579fbf-d456-40d5-abca-9ec8fad2d8eb · outbound

This paper cites Mitigating unwanted biases with adversarial learning.

Halpern Iteration Achieves $\tilde{\mathcal{O}}(\epsilon^{-1/p})$ $p$th-Order Oracle Complexity for Monotone Variational Inequalities Mitigating unwanted biases with adversarial learning

Reference 65

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:48:52.562014Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Coverage vector

Reference resolution

Outbound references

Pith citing papers