Accelerated convergence conjecture for Algorithm HOT-2

Let Lˉ\bar{L} be a continuously differentiable, smooth, and strongly convex function, and consider constant regressors. Let {θk}k=0\{\theta_k\}_{k=0}^{\infty} denote the iterates generated by Algorithm HOT-2. Accelerated convergence conjecture. The iterates {θk}k=0\{\theta_k\}_{k=0}^{\infty} should satisfy a convergence rate of O(log(1/ϵ))\mathcal{O}(\log(1/\epsilon)). The conjecture predicts accelerated convergence for the proposed high-order tuner in the general strongly convex setting, where the superposition property used by Nesterov's estimating-sequence method is unavailable. Its status is not established in the supplied text.

Sources & referencesView supporting material

Primary source

José M. Moreu and Anuradha M. Annaswamy, “A Stable High-order Tuner for General Convex Functions”, arXiv:2011.09996 (2021).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.