It is known that classical subspace-based direction-of-arrival (DOA) estimation algorithms are not straightforwardly applicable to scenarios with unknown spatially nonuniform noise. Among the state-of-the-art solutions, this problem is tackled by iterative subspace estimation algorithms to incorporate subspace-based approaches or nonlinear optimization routines to bypass the direct identification of subspaces. In this paper, the problem of DOA estimation in nonuniform noise is revisited by devising two computationally efficient proposals. It is proved herein that, if the signals are uncorrelated, the signal and noise subspaces can be directly obtained from the eigendecomposition of a reduced array covariance matrix. On the other hand, when the signals are correlated, the estimation of the noise covariance matrix is formulated into a rank minimization problem which can be approximately solved by semidefinite programming. In both cases, the signal and noise subspaces are easy to compute without iterations. Consequently, classical subspace-based algorithms can be employed to determine the DOAs. Numerical examples are provided to demonstrate the performance and applicability of the proposed methods.