Adaptive certification for the pure reflected gradient method
Establish whether an adaptive step-size rule can be certified for the pure reflected gradient method, without evaluation-point memory, under monotone Lipschitz variational-inequality assumptions.
References
Whether memory can be removed --- i.e. whether an adaptive step can be certified for PRG itself --- is open; the broken-telescoping mechanism of Section~\ref{sec:adaptive} uses the filter channel nontrivially.
The full range $(0,(\sqrt2-1)/L)$ for arbitrary nonzero filters and general nonlinear $B$ remains open; its exact performance-estimation formulation is recorded in Appendix~\ref{app:barrier}.
If \emph{finite identification of the optimal face for PRG on polyhedral sets} holds in general (the only missing ingredient), Theorem~\ref{thm:xaff} upgrades to convergence for all $\lambda|M|<1/\sqrt3$, matching the unconstrained sharp constant.
The unconditional assertion ``$\sum_k|B(u_k)|2<\infty$ for every trajectory at $\lambda<1/(\sqrt3\,L)$'' --- which together with part~(b) would complete the nonlinear sharp-threshold theorem --- is an absolute-stability statement for the feedback loop of Remark~\ref{rem:nonlinear-gap}, whose transfer function has a simple pole on the unit circle; it is open.