• A new method for setting the matrix parameter in the linearly involved GMC is proposed. • An alternative algorithm is presented to solve the linear involved convexity-preserving model. • Two properties of the solution path are proved to help with tuning parameter selection. The generalized minimax concave (GMC) penalty is a newly proposed regularizer that can maintain the convexity of the objective function. This paper deals with signal recovery with the linearly involved GMC penalty. First, we propose a new method to set the matrix parameter in the penalty via solving a feasibility problem. The new method possesses appealing advantages over the existing method. Second, we recast the linearly involved GMC model as a saddle-point problem and use the primal-dual hybrid gradient (PDHG) algorithm to compute the solution. Another important work in this paper is that we provide guidance on the tuning parameter selection by proving desirable properties of the solution path. Finally, we apply the linearly involved GMC penalty to 1-D signal recovery and matrix regression. Numerical results show that the linearly involved GMC penalty can obtain better recovery performance and preserve the signal structure more successfully in comparison with the total variation (TV) regularizer.