diff --git a/test/run_tests_all_solvers.jl b/test/run_tests_all_solvers.jl
index c1feeb0f5..2774b9d69 100644
--- a/test/run_tests_all_solvers.jl
+++ b/test/run_tests_all_solvers.jl
@@ -8,7 +8,7 @@ end
 
 if isdir(Pkg.dir("SCS"))
     using SCS
-    push!(solvers, SCSSolver())
+    push!(solvers, SCSSolver(verbose=0))
 end
 
 if isdir(Pkg.dir("Gurobi"))
diff --git a/test/test_sdp.jl b/test/test_sdp.jl
index 2383c4b88..099bc4733 100644
--- a/test/test_sdp.jl
+++ b/test/test_sdp.jl
@@ -3,9 +3,6 @@ using Convex
 
 TOL = 1e-2
 
-using SCS
-set_default_solver(SCSSolver())
-
 # SDP variables
 y = Variable((2,2), :Semidefinite)
 p = minimize(y[1,1])
@@ -19,6 +16,8 @@ solve!(p)
 @test_approx_eq_eps p.optval 0 TOL
 
 # Solution is obtained as y[2,2] -> infinity
+# This test fails on Mosek. See
+# https://github.com/JuliaOpt/Mosek.jl/issues/29
 y = Variable((2, 2), :Semidefinite)
 p = minimize(y[1, 1], y[1, 2] == 1)
 solve!(p)