diff --git a/dune/solvers/iterationsteps/projectedgradientstep.cc b/dune/solvers/iterationsteps/projectedgradientstep.cc
index e7af64dc95786e2cf721cf5470251a2a6c44f042..debdd8a8464c2d10a5f4828a5990c2dcaf2fa92b 100644
--- a/dune/solvers/iterationsteps/projectedgradientstep.cc
+++ b/dune/solvers/iterationsteps/projectedgradientstep.cc
@@ -67,9 +67,7 @@ inline void ProjectedGradientStep<MatrixType, VectorType>::computeGeneralizedCP(
 
         // Check if we really have a local minimum in this segment
         if (localMin < 0) {
-
-            field_type min = computeEnergy(*mat_,cauchyPoint,*rhs_);
-
+            //field_type min = computeEnergy(*mat_,cauchyPoint,*rhs_);
             //std::cout<<"Generalized Cauchy Point "<<min<<" at previous breakpoint "<<oldBreakPoint<<std::endl;
 
             *this->x_ = cauchyPoint;
@@ -79,10 +77,9 @@ inline void ProjectedGradientStep<MatrixType, VectorType>::computeGeneralizedCP(
         } else if (localMin<=(bP-oldBreakPoint)) {
 
             cauchyPoint.axpy(localMin,projGrad);
-            field_type min = computeEnergy(*mat_,cauchyPoint,*rhs_);
-
-           // std::cout<<"Generalized Cauchy Point found  "<<min<<" at local min "<<localMin
-           //     <<" BP "<<bP+localMin<<std::endl;
+            //field_type min = computeEnergy(*mat_,cauchyPoint,*rhs_);
+            //std::cout<<"Generalized Cauchy Point found  "<<min<<" at local min "<<localMin
+            //         <<" BP "<<bP+localMin<<std::endl;
 
             *this->x_ = cauchyPoint;