A General Inertial Proximal Point Algorithm for Mixed Variational Inequality Problem

In this paper, we first propose a general inertial proximal point algorithm (PPA) for the mixed variational inequality (VI) problem. Based on our knowledge, without stronger assumptions, convergence rate result is not known in the literature for inertial type PPAs. Under certain conditions, we are able to establish the global convergence and nonasymptotic O(1/k) convergence rate result (under certain measure) of the proposed general inertial PPA. We then show that both the linearized augmented Lagrangian method (ALM) and the linearized alternating direction method of multipliers (ADMM) for structured convex optimization are applications of a general PPA, provided that the algorithmic parameters are properly chosen. Consequently, global convergence and convergence rate results of the linearized ALM and ADMM follow directly from results existing in the literature. In particular, by applying the proposed inertial PPA for mixed VI to structured convex optimization, we obtain inertial versions of the linearized ALM and ADMM whose global convergence are guaranteed. We also demonstrate the effect of the inertial extrapolation step via experimental results on the compressive principal component pursuit problem.