{"author_name":"Paper Radio","author_url":"https://montaan.com/","height":480,"html":"<iframe src=\"https://montaan.com/embed/episode/d15313a1-9941-458f-b563-15c5255edb3f\" width=\"1280\" height=\"480\" title=\"Local linear convergence of the primal-dual hybrid gradient algorithm for semidefinite programming — Paper Radio\" frameborder=\"0\" allow=\"autoplay; fullscreen; picture-in-picture\" allowfullscreen loading=\"lazy\" style=\"border:0;display:block;max-width:100%;\"></iframe>","provider_name":"Paper Radio","provider_url":"https://montaan.com/","thumbnail_url":"https://montaan.com/media/episodes/d15313a1-9941-458f-b563-15c5255edb3f/episode.poster.webp","title":"Local linear convergence of the primal-dual hybrid gradient algorithm for semidefinite programming","type":"rich","version":"1.0","width":1280}