Asymptotic Convergence Analysis of High-Order Proximal-Point Methods Beyond Sublinear Rates

This paper investigates the asymptotic convergence behavior of the high-order proximal-point algorithm (HiPPA) to global minimizers, extending existing analyses beyond sublinear convergence rates and complexity analysis. Specifically, we study the proximal operator of a proper lower semicontinuous function augmented with a pth-order regularization for p>1, and establish the convergence of HiPPA to a global minimizer with a particular focus on its convergence rate. To this end, we focus on minimizing functions in the class of uniformly quasiconvex functions, which includes strongly convex, uniformly convex, and strongly quasiconvex functions as special cases. Our analysis reveals the following convergence behaviors of HiPPA when the uniform quasiconvexity modulus φ admits a power function of degree q as a lower bound, i.e., φ(t) ≥ c tq for some c>0, on an interval I: (i) for q∈ (1,2) and I=[0,1), HiPPA exhibits a local linear rate for p∈ [q,2); (ii) HiPPA converges linearly when p=2, q=2, and also when p=q>2, provided that I=[0,∞); (iii) for q≥ 2 and I=[0,∞), HiPPA achieves a superlinear rate for p>q. Notably, to our knowledge, some of these results are novel, even in the context of strongly or uniformly convex functions, offering new insights into optimizing generalized convex problems.