“…To exploit the existing methods of solving Problem 1, as presented in [5,13,14,17,20,22,41,42], we shall consider the following convex optimization problem: minimize f (x) := 1 2 x, Q x + b, x subject to x ∈Ĉ := m i=1 C i , where Q ∈ R K ×K is positive definite, b ∈ R K , and C i ⊂ R K (i = 1, 2, . .…”