For linear systems with unsymmetric but positive definite system matrix (i.e., the symmetric part is positive definite), conjugate residual type algorithms are discussed and their convergence behaviour is studied. Using standard variational techniques, convergence proofs are obtained for arbitrary methods of this type. Well known results are shown to follow as corollaries.