In this paper we deal with the problem of stabilizing linear, time-invariant plants using feedback control configurations that are subject to sparsity constraints. Recent results show that given a strongly stabilizable plant, the class of all stabilizing controllers that satisfy certain given sparsity constraints admits a convex representation via Zames's Q-parametrization. More precisely, if the pre-specified sparsity constraints imposed on the controller are quadratically invariant with respect to the plant, then such a convex representation is guaranteed to exist. The most useful feature of the aforementioned results is that the sparsity constraints on the controller can be recast as convex constraints on the Q-parameter, which makes this approach suitable for optimal controller design (in the ℋ² sense) using numerical tools readily available from the classical, centralized optimal ℋ² synthesis. All these procedures rely crucially on the fact that some stabilizing controller that verifies the imposed sparsity constraints is a priori known, while design procedures for such a controller to initialize the aforementioned optimization schemes are not yet available. This paper provides necessary and sufficient conditions for such a plant to be stabilizable with a controller having the given sparsity pattern. These conditions are formulated in terms of the existence of a doubly coprime factorization of the plant with additional sparsity constraints on certain factors. We show that the computation of such a factorization is equivalent to solving an exact model-matching problem. We also give the parametrization of the set of all decentralized stabilizing controllers by imposing additional constraints on the Youla parameter. These constraints are for the Youla parameter to lie in the set of all stable transfer function matrices belonging to a certain linear subspace.