Table 1 Pseudo-code for efficient classification of the parameter space.

begin: set K* = K and K _inconsistent = ∅

while (K* ≠ ∅)

   consider loop i

   generate parameter subset (k _i ± Δk) ∈ K*

   perform dual SDP optimization

   if solution (γ, λ _i , P, r, S) exists

      // k _i is dual feasible/primal infeasible

      while (dual feasibility holds)

         increase Δk _i

      end

      K* = K*\(k _i ± Δk _i )

      K _inconsistent = K _inconsistent ∪ (k _i ± Δk _i )

   end

end