During recent decades, there have been a great number of research articles studying interior method to solve problems in mathematical programming and constrained optimization. Stewart and O'Leary obtained an upper bound for scaled pseudoinverses 11222sup||()||WPWXW+∈ of a matrix X where P is a set of diagonal positive definite matrices. Wei improved their results to obtain the supremum of scaled pseudoinverses and derived the stability property of scaled pseudoinverses. Forsgren further generalized these results to derive the supremum of weighted pseudoinverses 11222sup∈ where P is a set of diagonally dominant positive semidefinite matrices, by using a signature decomposition of weighting matrices W and by applying the Binet-Cauchy formula and Cramer's rule for determinants. The results are also extended to equality constrained linear least squares problems. In this paper we extend Forsgren's results to a general complex matrix X to establish several equivalent formulae for 11222sup||()||WPWXW+∈, where P is a set of diagonally dominant positive semidefinite matrices, or a set of weighting matrices arising from solving equality constrained least squares problems. We also discuss the stability property of these weighted pseudoinverses.