In coherent imaging systems, such as the synthetic aperture radar (SAR), the observed images are contaminated by multiplicative noise. Due to the edge-preserving feature of the total variation (TV), variational models with TV regularization have attracted much interest in removing multiplicative noise. However, the fidelity term of the variational model, based on maximum a posteriori estimation, is not convex, and so, it is usually difficult to find a global solution. Hence, the logarithmic function is used to transform the nonconvex variational model to the convex one. In this paper, instead of using the log, we exploit the th root function to relax the nonconvexity of the variational model. An algorithm based on the augmented Lagrangian function, which has been applied to solve the log transformed convex variational model, can be applied to solve our proposed model. However, this algorithm requires solving a subproblem, which does not have a closed-form solution, at each iteration. Hence, we propose to adapt the linearized proximal alternating minimization algorithm, which does not require inner iterations for solving the subproblems. In addition, the proposed method is very simple and highly parallelizable; thus, it is efficient to remove multiplicative noise in huge SAR images. The proposed model for multiplicative noise removal shows overall better performance than the convex model based on the log transformation.