diff --git a/src/myblockproblem.hh b/src/myblockproblem.hh
index c54d8253c92fb11a524962f2befd90883eb9d422..7be89165bf6d7bdab0b5e48871604c43e13c23fa 100644
--- a/src/myblockproblem.hh
+++ b/src/myblockproblem.hh
@@ -86,24 +86,22 @@ class MyBlockProblem<ConvexProblemTypeTEMPLATE>::IterateObject {
 
   /** \brief Minimize a local problem using a scalar Gauss-Seidel method
    * \param[out] ui The solution
-   * \param i Block number
+   * \param m Block number
    * \param ignore Set of degrees of freedom to leave untouched
    *
    * \return The minimizer of the local functional in the variable ui
    */
   void solveLocalProblem(
-      LocalVectorType& ui, int i,
+      LocalVectorType& ui, int m,
       const typename Dune::BitSetVector<block_size>::const_reference ignore) {
     // Note: problem.Am and problem.a will be ignored
     // Note: ignore is currently ignored (what's it used for anyway?)
     {
-      int const m = i;
-
       LocalMatrixType const* localA = NULL;
       LocalVectorType localb(problem.f[m]);
 
       typename MatrixType::row_type::ConstIterator it;
-      typename MatrixType::row_type::ConstIterator end = problem.A[i].end();
+      typename MatrixType::row_type::ConstIterator end = problem.A[m].end();
       for (it = problem.A[m].begin(); it != end; ++it) {
         int const j = it.index();
         if (j == m)