Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming | Paper Citation Record

Observation 6923f5e2-cad5-47b5-bcd9-e419d1ca29ee · outbound

This paper cites cuhallar: A gpu accelerated low-rank augmented lagrangian method for large-scale semidefinite programming.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming cuhallar: A gpu accelerated low-rank augmented lagrangian method for large-scale semidefinite programming

Reference 1

Resolution: metadata mismatch; arxiv_id, observed 2026-07-10T01:26:43.268170Z

Source-reported events for the cited work

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

Observation 6f20274c-29b0-4305-a0d6-2508b0ac7481 · outbound

This paper cites Interior point methods in semidefinite programming with applications to combinatorial optimization.SIAM Journal on Optimization, 5(1):13–51, 1995.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Interior point methods in semidefinite programming with applications to combinatorial optimization.SIAM Journal on Optimization, 5(1):13–51, 1995

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.706643Z

Source-reported events for the cited work

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

Observation b188b1aa-5fdd-467c-a3d8-b0b97e109213 · outbound

This paper cites Haeberly, and Michael L.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Haeberly, and Michael L

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.729756Z

Source-reported events for the cited work

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

Observation 5be55ad9-61b5-4cc3-996b-6b04683302f7 · outbound

This paper cites Practicallarge-scalelinearprogrammingusingprimal-dualhybridgradient.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Practicallarge-scalelinearprogrammingusingprimal-dualhybridgradient

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.774252Z

Source-reported events for the cited work

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

Observation 11606bf4-af46-4c58-8ccd-577c751e2dff · outbound

This paper cites PDLP: A practical first-order method for large-scale linear programming.Mathematical Programming Computation, 2026.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming PDLP: A practical first-order method for large-scale linear programming.Mathematical Programming Computation, 2026

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.687871Z

Source-reported events for the cited work

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

Observation 988a36cd-530d-4d52-af58-16440461a33e · outbound

This paper cites Faster first-order primal-dual methods for linear programming using restarts and sharpness.Mathematical Programming, 201(1–2):133–184, 2023.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Faster first-order primal-dual methods for linear programming using restarts and sharpness.Mathematical Programming, 201(1–2):133–184, 2023

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.685934Z

Source-reported events for the cited work

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

Observation 9f6070c0-a4d9-46a2-85b1-e3c8dce8727e · outbound

This paper cites The Chambolle–Pock method converges weakly withθ >1/2andτ σ∥L∥ 2 <4/(1 + 2θ).Optimization Letters, 20(3):503–520, 2026.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming The Chambolle–Pock method converges weakly withθ >1/2andτ σ∥L∥ 2 <4/(1 + 2θ).Optimization Letters, 20(3):503–520, 2026

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.682096Z

Source-reported events for the cited work

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

Observation 9221e630-ba77-48cd-8c79-434f961dd3e9 · outbound

This paper cites Bauschke and Patrick L.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Bauschke and Patrick L

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.680212Z

Source-reported events for the cited work

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

Observation cabf03a0-7395-45f9-94f2-cb4a78029c94 · outbound

This paper cites Boyd, Laurent El Ghaoui, Eric Feron, and Venkataramanan Balakrishnan.Linear Matrix Inequalities in System and Control Theory, volume 15 ofStudies in Applied Mathematics.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Boyd, Laurent El Ghaoui, Eric Feron, and Venkataramanan Balakrishnan.Linear Matrix Inequalities in System and Control Theory, volume 15 ofStudies in Applied Mathematics

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.683881Z

Source-reported events for the cited work

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

Observation babe2ec7-6859-4bf1-9b1c-0d0ff59eec94 · outbound

This paper cites Boyd, Neal Parikh, Eric Chu, Borja Peleato, and Jonathan Eckstein.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Boyd, Neal Parikh, Eric Chu, Borja Peleato, and Jonathan Eckstein

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.689625Z

Source-reported events for the cited work

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

Observation b9b2fec5-74a8-4064-b1db-6b5a963d7f79 · outbound

This paper cites Boyd and Lieven Vandenberghe.Convex Optimization.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Boyd and Lieven Vandenberghe.Convex Optimization

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.678441Z

Source-reported events for the cited work

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

Observation 40760bb6-98a0-4543-9725-2ebd9b006e25 · outbound

This paper cites an unresolved cited work.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Unresolved cited work

Reference 12

Resolution: unresolved; raw_fallback, observed 2026-07-10T01:26:43.691651Z

Source-reported events for the cited work

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

Observation 7840225e-1253-4559-83c0-af09e4220e81 · outbound

This paper cites an unresolved cited work.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Unresolved cited work

Reference 13

Resolution: unresolved; raw_fallback, observed 2026-07-10T01:26:43.670727Z

Source-reported events for the cited work

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

Observation f1f766d4-b87f-4192-92de-0ffe24cdeb83 · outbound

This paper cites A first-order primal-dual algorithm for convex problems with applications to imaging.Journal of Mathematical Imaging and Vision, 40(1):120–145, 2011.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming A first-order primal-dual algorithm for convex problems with applications to imaging.Journal of Mathematical Imaging and Vision, 40(1):120–145, 2011

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.673941Z

Source-reported events for the cited work

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

Observation fbca8b64-fe56-4268-a7cc-ddb4558481d2 · outbound

This paper cites On the ergodic convergence rates of a first-order primal–dual algorithm.Mathematical Programming, 159(1–2):253–287, 2016.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming On the ergodic convergence rates of a first-order primal–dual algorithm.Mathematical Programming, 159(1–2):253–287, 2016

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.699043Z

Source-reported events for the cited work

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

Observation 3292913e-cabb-49ea-83d1-ecde5c907f36 · outbound

This paper cites Constraint nondegeneracy, strong regularity, and nonsingularity in semidefinite programming.SIAM Journal on Optimization, 19(1):370–396.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Constraint nondegeneracy, strong regularity, and nonsingularity in semidefinite programming.SIAM Journal on Optimization, 19(1):370–396

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.665795Z

Source-reported events for the cited work

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

Observation b864ca96-7d29-42f0-bf8b-c87b8cdeb95e · outbound

This paper cites A golden ratio primal-dual algorithm for structured convex opti- mization.Journal of Scientific Computing, 87(2):47, 2021.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming A golden ratio primal-dual algorithm for structured convex opti- mization.Journal of Scientific Computing, 87(2):47, 2021

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.663156Z

Source-reported events for the cited work

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

Observation 89a00b90-690b-49f0-95c9-360ca17683af · outbound

This paper cites HPR-LP: An imple- mentation of an HPR method for solving linear programming.Mathematical Programming Computation, 2025.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming HPR-LP: An imple- mentation of an HPR method for solving linear programming.Mathematical Programming Computation, 2025

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.658681Z

Source-reported events for the cited work

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

Observation e6aea991-35cf-427e-8d12-4bc6bd85538a · outbound

This paper cites On the global and linear convergence of the generalized alternating direction method of multipliers.Journal of Scientific Computing, 66(3):889–916, 2016.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming On the global and linear convergence of the generalized alternating direction method of multipliers.Journal of Scientific Computing, 66(3):889–916, 2016

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.661048Z

Source-reported events for the cited work

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

Observation 7c3f83b1-4b51-4aa9-80c2-c54bbccd7513 · outbound

This paper cites New Understandings and Computation on Augmented Lagrangian Methods for Low-Rank Semidefinite Programming.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming New Understandings and Computation on Augmented Lagrangian Methods for Low-Rank Semidefinite Programming

Reference 20

Resolution: verified exact; local_arxiv, observed 2026-07-10T01:26:43.257681Z

Source-reported events for the cited work

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

Observation 5356c931-4ab2-4383-a1ca-8100f1b14b4f · outbound

This paper cites Dontchev and R.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Dontchev and R

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.697140Z

Source-reported events for the cited work

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

Observation 5df724b4-81cc-4fd5-b31f-7381add2dda9 · outbound

This paper cites an unresolved cited work.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Unresolved cited work

Reference 22

Resolution: unresolved; raw_fallback, observed 2026-07-10T01:26:43.676502Z

Source-reported events for the cited work

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

Observation a7cd04e5-f8c3-4d52-93f5-c317fc3bab06 · outbound

This paper cites Bertsekas.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Bertsekas

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.693340Z

Source-reported events for the cited work

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

Observation 26753808-6997-4b93-8da1-3a9670d918b7 · outbound

This paper cites Ageneralframeworkforaclassoffirstorderprimal-dual algorithms for convex optimization in imaging science.SIAM Journal on Imaging Sciences, 3(4):1015– 1046, 2010.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Ageneralframeworkforaclassoffirstorderprimal-dual algorithms for convex optimization in imaging science.SIAM Journal on Imaging Sciences, 3(4):1015– 1046, 2010

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.776181Z

Source-reported events for the cited work

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

Observation 5ebd9ff8-d46b-4ba1-b1f1-829e3ffb093f · outbound

This paper cites A dual algorithm for the solution of nonlinear variational problems via finite element approximation.Computers and Mathematics with Applications, 2(1):17–40, 1976.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming A dual algorithm for the solution of nonlinear variational problems via finite element approximation.Computers and Mathematics with Applications, 2(1):17–40, 1976

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.762985Z

Source-reported events for the cited work

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

Observation f6825c36-b3ae-4038-bc6b-a26e13ef973c · outbound

This paper cites an unresolved cited work.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Unresolved cited work

Reference 26

Resolution: unresolved; raw_fallback, observed 2026-07-10T01:26:43.764742Z

Source-reported events for the cited work

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

Observation d44ac85a-53e4-4b59-adde-ee512cad2f40 · outbound

This paper cites cuADMM: GPU-accelerated first-order optimiza- tion for large-scale multi-block semidefinite programs.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming cuADMM: GPU-accelerated first-order optimiza- tion for large-scale multi-block semidefinite programs

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.761066Z

Source-reported events for the cited work

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

Observation 9a696415-7ffb-47ff-b5dd-c0a585ea9363 · outbound

This paper cites Linear rate convergence of the alternating direction method of multipliers for convex composite programming.Mathematics of Operations Research, 43(2):622–637.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Linear rate convergence of the alternating direction method of multipliers for convex composite programming.Mathematics of Operations Research, 43(2):622–637

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.751769Z

Source-reported events for the cited work

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

Observation d34e4554-4a67-4d39-9ff0-01ba2de83d35 · outbound

This paper cites Building Romewith convexoptimization.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Building Romewith convexoptimization

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.749894Z

Source-reported events for the cited work

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

Observation 017730ca-7d88-42bd-ae31-f71eb05dc11c · outbound

This paper cites A low-rank ADMM splitting approach for semidefinite programming.INFORMS Journal on Computing, 2025.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming A low-rank ADMM splitting approach for semidefinite programming.INFORMS Journal on Computing, 2025

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.753708Z

Source-reported events for the cited work

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

Observation 6869dfbd-6a59-4866-9d7f-3ac3c9dae823 · outbound

This paper cites A generalized primal-dual algorithm with improved convergence condition for saddle point problems.SIAM Journal on Imaging Sciences, 15(3):1157–1183, 2022.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming A generalized primal-dual algorithm with improved convergence condition for saddle point problems.SIAM Journal on Imaging Sciences, 15(3):1157–1183, 2022

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.755990Z

Source-reported events for the cited work

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

Observation 577d4a26-c5ed-419f-94b8-bc41973e13f4 · outbound

This paper cites Convergence analysis of primal-dual algorithms for a saddle-point problem: From contraction perspective.SIAM Journal on Imaging Sciences, 5(1):119–149, 2012.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Convergence analysis of primal-dual algorithms for a saddle-point problem: From contraction perspective.SIAM Journal on Imaging Sciences, 5(1):119–149, 2012

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.759166Z

Source-reported events for the cited work

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

Observation 21d69f4e-ebb5-490e-93fb-2ef317a9cf17 · outbound

This paper cites Bregman primal-dual first-order method and applications to sparse semidefinite programming.Computational Optimization and Applications, 81(1):127–159, 2022.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Bregman primal-dual first-order method and applications to sparse semidefinite programming.Computational Optimization and Applications, 81(1):127–159, 2022

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.766771Z

Source-reported events for the cited work

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

Observation 07edc46f-b3f4-4674-af0b-c6c604c80308 · outbound

This paper cites Bregman three-operator splitting methods.Journal of Optimiza- tion Theory and Applications, 196(3):936–972, 2023.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Bregman three-operator splitting methods.Journal of Optimiza- tion Theory and Applications, 196(3):936–972, 2023

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.747928Z

Source-reported events for the cited work

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

Observation aa3ecf38-6b5d-4392-ba11-8b800756e272 · outbound

This paper cites Local Linear Convergence of the Alternating Direction Method of Multipliers for Semidefinite Programming under Strict Complementarity.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Local Linear Convergence of the Alternating Direction Method of Multipliers for Semidefinite Programming under Strict Complementarity

Reference 35

Resolution: verified exact; local_arxiv, observed 2026-07-10T01:26:43.251863Z

Source-reported events for the cited work

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

Observation d53cbdde-d40f-41e3-974d-5d0922ebc9c6 · outbound

This paper cites Local second-order limit dynamics of ADMM for SDP.arXiv preprint, 2026.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Local second-order limit dynamics of ADMM for SDP.arXiv preprint, 2026

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.744198Z

Source-reported events for the cited work

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

Observation 523ea1a0-fc64-48fe-b3c3-5f3a5640a2e7 · outbound

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

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Auto-conditioned primal-dual hybrid gradient method and alternating direction method of multipliers.arXiv preprint, 2024

Reference 37

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.746106Z

Source-reported events for the cited work

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

Observation ed30ecc6-a9b4-4929-8779-6b1afce4848d · outbound

This paper cites Lasserre.Moments, Positive Polynomials and Their Applications.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Lasserre.Moments, Positive Polynomials and Their Applications

Reference 38

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.738821Z

Source-reported events for the cited work

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

Observation 63cca583-238c-48d3-b5b0-df68208620fb · outbound

This paper cites Activesets, nonsmoothness, andsensitivity.SIAM Journal on Optimization, 13(3):702– 725, 2002.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Activesets, nonsmoothness, andsensitivity.SIAM Journal on Optimization, 13(3):702– 725, 2002

Reference 39

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.740634Z

Source-reported events for the cited work

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

Observation 78431cb5-5026-4fa6-bcc2-208e072acaa5 · outbound

This paper cites D-PDLP: Scaling PDLP to Distributed Multi-GPU Systems.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming D-PDLP: Scaling PDLP to Distributed Multi-GPU Systems

Reference 40

Resolution: verified exact; local_arxiv, observed 2026-07-10T01:26:43.260793Z

Source-reported events for the cited work

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

Observation af9f2bcf-7668-4ca3-bae8-a3a0d24bd290 · outbound

This paper cites Local convergence properties of Douglas–Rachford and alternating direction method of multipliers.Journal of Optimization Theory and Applications, 172(3):874–913, 2017.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Local convergence properties of Douglas–Rachford and alternating direction method of multipliers.Journal of Optimization Theory and Applications, 172(3):874–913, 2017

Reference 41

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.742449Z

Source-reported events for the cited work

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

Observation 162d2397-d162-47ea-aaf6-176e643228d0 · outbound

This paper cites A practical GPU-enhanced matrix- free primal-dual method for large-scale conic programs.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming A practical GPU-enhanced matrix- free primal-dual method for large-scale conic programs

Reference 42

Resolution: verified exact; arxiv_id, observed 2026-07-10T01:26:43.254893Z

Source-reported events for the cited work

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

Observation 0371c2c4-4868-40ad-8242-1eb9f6eecc01 · outbound

This paper cites cuPDLP.jl: A GPU implementation of restarted primal-dual hybrid gradient for linear programming in Julia.Operations Research, 73(6):3440–3452, 2025.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming cuPDLP.jl: A GPU implementation of restarted primal-dual hybrid gradient for linear programming in Julia.Operations Research, 73(6):3440–3452, 2025

Reference 43

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.768892Z

Source-reported events for the cited work

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

Observation 06dc7c93-9cf2-4f85-ad5e-d51d7dc2e1b0 · outbound

This paper cites On the geometry and refined rate of primal–dual hybrid gradient for linear programming.Mathematical Programming, 212:349–387, 2025.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming On the geometry and refined rate of primal–dual hybrid gradient for linear programming.Mathematical Programming, 212:349–387, 2025

Reference 44

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.770830Z

Source-reported events for the cited work

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

Observation 0da40487-87b3-4558-9cd7-051aa2d86c02 · outbound

This paper cites Understanding the convergence of the preconditioned PDHG method: A view of indefinite proximal ADMM.Journal of Scientific Computing, 94(3):60, 2023.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Understanding the convergence of the preconditioned PDHG method: A view of indefinite proximal ADMM.Journal of Scientific Computing, 94(3):60, 2023

Reference 45

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.731777Z

Source-reported events for the cited work

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

Observation c0401049-22b6-4a62-8af8-dcb879407069 · outbound

This paper cites an unresolved cited work.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Unresolved cited work

Reference 46

Resolution: unresolved; raw_fallback, observed 2026-07-10T01:26:43.733502Z

Source-reported events for the cited work

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

Observation 779bfa35-8650-4a48-b691-702f32b80f3b · outbound

This paper cites an unresolved cited work.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Unresolved cited work

Reference 47

Resolution: unresolved; raw_fallback, observed 2026-07-10T01:26:43.720502Z

Source-reported events for the cited work

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

Observation cc06681a-e945-48b7-983d-a00a5ea6c339 · outbound

This paper cites On the equivalence of the primal-dual hybrid gradient method and Douglas–Rachford splitting.Mathematical Programming, 179(1–2):85–108, 2020.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming On the equivalence of the primal-dual hybrid gradient method and Douglas–Rachford splitting.Mathematical Programming, 179(1–2):85–108, 2020

Reference 48

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.724112Z

Source-reported events for the cited work

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

Observation d5e46b55-a44a-4edb-ba9d-fff76f67684b · outbound

This paper cites An algorithm for minimizing the Mumford–Shah functional.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming An algorithm for minimizing the Mumford–Shah functional

Reference 49

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.710978Z

Source-reported events for the cited work

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

Observation 2a38e60d-280e-4e5c-bfe5-46484c24aaa1 · outbound

This paper cites Tyrrell Rockafellar.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Tyrrell Rockafellar

Reference 50

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.716647Z

Source-reported events for the cited work

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

Observation f8371c87-7bb1-44e2-9c99-de4f08a469b1 · outbound

This paper cites an unresolved cited work.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Unresolved cited work

Reference 51

Resolution: unresolved; raw_fallback, observed 2026-07-10T01:26:43.722133Z

Source-reported events for the cited work

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

Observation 58c09153-e1d1-4788-b46c-981f88fb0c6b · outbound

This paper cites Semismooth matrix-valued functions.Mathematics of Operations Research, 27(1):150–169, 2002.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Semismooth matrix-valued functions.Mathematics of Operations Research, 27(1):150–169, 2002

Reference 52

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.737066Z

Source-reported events for the cited work

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

Observation 6be56a52-3b46-47cc-af3e-c3152cdf9ff0 · outbound

This paper cites A preconditioned augmented Lagrangian method for solving semidefinite programming problems.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming A preconditioned augmented Lagrangian method for solving semidefinite programming problems

Reference 53

Resolution: verified exact; local_arxiv, observed 2026-07-10T01:26:43.263243Z

Source-reported events for the cited work

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

Observation 8777fe1b-8e77-4334-a09f-51136f7a7b08 · outbound

This paper cites an unresolved cited work.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Unresolved cited work

Reference 54

Resolution: unresolved; raw_fallback, observed 2026-07-10T01:26:43.772507Z

Source-reported events for the cited work

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

Observation cfba5b9a-be2a-43d0-9f02-adbb6d31712d · outbound

This paper cites Tütüncü, and Michael J.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Tütüncü, and Michael J

Reference 55

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.714794Z

Source-reported events for the cited work

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

Observation 2c40c5c6-3d13-4ea1-bd1d-409a7fd39f34 · outbound

This paper cites The Chambolle–Pock method also converges weakly with0< θ≤1andτ σ∥L∥ 2 < 4θ(2−θ)/(1−2θ+ 9θ 2 −4θ 3).arXiv preprint, 2026.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming The Chambolle–Pock method also converges weakly with0< θ≤1andτ σ∥L∥ 2 < 4θ(2−θ)/(1−2θ+ 9θ 2 −4θ 3).arXiv preprint, 2026

Reference 56

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.718764Z

Source-reported events for the cited work

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

Observation 6e498302-334a-4858-bd1a-960aec746026 · outbound

This paper cites Andersen.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Andersen

Reference 57

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.712923Z

Source-reported events for the cited work

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

Observation 4db5d666-0c78-49e0-8a26-7b8435b29025 · outbound

This paper cites an unresolved cited work.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Unresolved cited work

Reference 58

Resolution: unresolved; raw_fallback, observed 2026-07-10T01:26:43.727965Z

Source-reported events for the cited work

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

Observation e72526dd-b652-4c72-b59c-beb9f3358d28 · outbound

This paper cites Solving low-rank semidefinite programs via manifold optimization.Journal of Scientific Computing, 104(1):33, 2025.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Solving low-rank semidefinite programs via manifold optimization.Journal of Scientific Computing, 104(1):33, 2025

Reference 59

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.708729Z

Source-reported events for the cited work

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

Observation bc32b8eb-9815-417b-b541-57409a0bced4 · outbound

This paper cites A Tuning-Free Primal-Dual Splitting Algorithm for Large-Scale Semidefinite Programming.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming A Tuning-Free Primal-Dual Splitting Algorithm for Large-Scale Semidefinite Programming

Reference 60

Resolution: verified exact; local_arxiv, observed 2026-07-10T01:26:43.265616Z

Source-reported events for the cited work

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

Observation 73b503fe-21cf-41c1-90e7-e366b8eff50a · outbound

This paper cites Alternating direction augmented lagrangian methods for semidefinite programming.Mathematical Programming Computation, 2(3–4):203–230, 2010.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Alternating direction augmented lagrangian methods for semidefinite programming.Mathematical Programming Computation, 2(3–4):203–230, 2010

Reference 61

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.702997Z

Source-reported events for the cited work

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

Observation c006c5c7-ef97-4d59-a1c1-c5162755ae3a · outbound

This paper cites Kluwer Academic Publishers, Boston, MA, 2000.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Kluwer Academic Publishers, Boston, MA, 2000

Reference 62

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.726108Z

Source-reported events for the cited work

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

Observation 7f458a44-ac9c-4048-ad79-a905ba0dcf2b · outbound

This paper cites an unresolved cited work.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Unresolved cited work

Reference 63

Resolution: unresolved; raw_fallback, observed 2026-07-10T01:26:43.735147Z

Source-reported events for the cited work

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

Observation 94b6e376-7fd6-4174-92b6-f1f22abda7dc · outbound

This paper cites an unresolved cited work.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming Unresolved cited work

Reference 64

Resolution: unresolved; raw_fallback, observed 2026-07-10T01:26:43.704740Z

Source-reported events for the cited work

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

Observation 4328a234-6155-4ccc-84cf-9f1f6417315c · outbound

This paper cites SDPNAL+: A majorized semismooth Newton-CG augmentedlagrangianmethodforsemidefiniteprogrammingwithnonnegativeconstraints.Mathematical Programming Computation, 7(3):331–366, 2015.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming SDPNAL+: A majorized semismooth Newton-CG augmentedlagrangianmethodforsemidefiniteprogrammingwithnonnegativeconstraints.Mathematical Programming Computation, 7(3):331–366, 2015

Reference 65

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.701011Z

Source-reported events for the cited work

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

Observation f86e138b-d464-452c-bdb1-5ea2d4695b29 · outbound

This paper cites A Newton-CG augmented lagrangian method for semidefinite programming.SIAM Journal on Optimization, 20(4):1737–1765, 2010.

Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming A Newton-CG augmented lagrangian method for semidefinite programming.SIAM Journal on Optimization, 20(4):1737–1765, 2010

Reference 66

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T01:26:43.695364Z

Source-reported events for the cited work

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

Coverage vector

Reference resolution

Outbound references

Pith citing papers