Algorithm 1 The cross-decomposition algorithm. |
Initialization step (): solve LMI (26) and choose and ;
Iterative step ( k):
-
(a)
first part: solve LMI of Theorem 1, and fix and ;
-
(b)
second part: solve LMI of Theorem 1, and fix ;
Final step: if then choose , else and return to Step 2.
|