A PARAMETERIZED THREE-OPERATOR SPLITTING ALGORITHM FOR NON-CONVEX MINIMIZATION PROBLEMS WITH APPLICATIONS.

In this paper, we propose a parameterized three-operator splitting algorithm to solve nonconvex minimization problems with the sum of three non-convex functions, where two of them have Lipschitz continuous gradients. We establish the convergence of the proposed algorithm under the KurdykaŁojasiewicz assumption by constructing a suitable energy function with a non-increasing property. As applications, we employ the proposed algorithm to solve low-rank matrix recovery and image inpainting problems. Numerical results demonstrate the efficiency and effectiveness of the proposed algorithm compared to other algorithms. [ABSTRACT FROM AUTHOR]