Before revision:  Our approach formulates the problem as solving a constrained non-convex minimization problem . By using the block structure of multicomponent systems , we propose an adaptive block Bregman proximal gradient algorithm that updates each order parameter alternatively .
After revision:  Our approach formulates the problem as solving a constrained non-convex minimization problem after an appropriate spatial discretization. To efficiently solve the above optimization problem , we propose an adaptive block Bregman proximal gradient algorithm that updates each order parameter alternatively .