A Block Inertial Bregman Proximal Algorithm for Nonsmooth Nonconvex Problems with Application to Symmetric Nonnegative Matrix Tri-Factorization

We propose BIBPA, a block inertial Bregman proximal algorithm for minimizing the sum of a block relatively smooth function (that is, relatively smooth concerning each block) and block separable nonsmooth nonconvex functions. We show that the cluster points of the sequence generated by BIBPA are critical points of the objective under standard assumptions, and this sequence converges globally when a regularization of the objective function satisfies the Kurdyka-Lojasiewicz (KL) property. We also provide the convergence rate when a regularization of the objective function satisfies the Lojasiewicz inequality. We apply BIBPA to the symmetric nonnegative matrix tri-factorization (SymTriNMF) problem, where we propose kernel functions for SymTriNMF and provide closed-form solutions for subproblems of BIBPA.