Necessary and sufficient conditions are formulated for the zeros of an arbitrary polynomial matrix to belong to a given region D of the complex plane. The conditions stem from a general optimization methodology mixing quadratic and semidefinite programming, LFRs and rank-one LMIs. They are expressed as an LMI feasibility problem that can be tackled with widespread powerful interior-point methods. Most importantly, the D-stability conditions can be combined with other LMI conditions arising in robust stability analysis.