Complexity of the relaxed Hybrid Proximal-Extragradient method under the large-step condition
From MaRDI portal
Publication:6428902
arXiv2303.04972MaRDI QIDQ6428902FDOQ6428902
Authors: B. F. Svaiter 
Publication date: 8 March 2023
Abstract: In this note we review the iteration-complexity of a relaxed Hybrid-Proximal Extragradient Method under the large step condition. We also derive some useful proprieties of this method.
Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Monotone operators and generalizations (47H05)
This page was built for publication: Complexity of the relaxed Hybrid Proximal-Extragradient method under the large-step condition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6428902)
