We propose a computational scheme for the solution of the so-called minimum variance control problem for discrete-time stochastic linear systems subject to an explicit constraint on the 2-norm of the input (random) sequence. In our approach, we utilize a state space framework in which the minimum variance control problem is interpreted as a finite-horizon stochastic optimal control problem with incomplete state information. We show that if the set of admissible control policies for the stochastic optimal control problem consists exclusively of sequences of causal (non-anticipative) control laws that can be expressed as linear combinations of all the past and present outputs of the system together with its past inputs, then the stochastic optimal control problem can be reduced to a deterministic, finite-dimensional optimization problem. Subsequently, we show that the latter optimization problem can be associated with an equivalent convex program and in particular, a quadratically constrained quadratic program (QCQP), by means of a bilinear transformation. Finally, we present numerical simulations that illustrate the key ideas of this work.