Bailey and Gower examined the least squares approximation C to a symmetric matrix B, when the squared discrepancies for diagonal elements receive specific nonunit weights. They focussed on mathematical properties of the optimal C, in constrained and unconstrained cases, rather than on how to obtain C for any given B. In the present paper a computational solution is given for the case where C is constrained to be positive semidefinite and of a fixed rank r or less. The solution is based on weakly constrained linear regression analysis.