Skip to main content
. 2018 Jun 9;18(6):1893. doi: 10.3390/s18061893
Algorithm 1 The cross-decomposition algorithm.
  1. Initialization step (k=1): solve LMI (26) and choose KSF and Kw;

  2. Iterative step (k):
    • (a)
      first part: solve LMI of Theorem 1, and fix Q01 and Q00;
    • (b)
      second part: solve LMI of Theorem 1, and fix KSF;
  3. Final step: if γ00part1γ00part2<ϵ then choose KSOF=Q011Q00, else k=k+1 and return to Step 2.