5 problems

An algorithm of Lur'e form is an algorithm described by the Lur'e system and gradient-input relation referred to in the source. Lessard's proximal-variant conjecture. Any algorithm…

The high-order proximal-point method uses a regularization parameter $p$, and the critical points of the objective may lie in either a “steep valley” or a “wide valley.” Valley-geo…

Let $\adaPG{}$ denote the adaptive proximal gradient method studied in the paper, and let accelerated algorithms refer to the accelerated methods considered there. Hidden Hölder gr…

Moudafi's conjecture. The restrictive assumption $\|x_{n+1}-x_n\|=o(\beta_n)$ can be removed by introducing a conditioning notion for equilibrium bifunctions. The proposed conditio…

Let $G$ be an algorithm of the form referred to as, and suppose that it converges with rate $\rho$. A proximal variant is obtained by replacing the relevant operator with its proxi…