Skip to main content
. 2022 Dec 1;22(23):9359. doi: 10.3390/s22239359
Algorithm 1 Proposed algorithm.
  1. Initialize P(m), A(m), Q(m), and m=0

  2. repeat

  3. R¯kold=R¯k(P(m),A(m),Q(m)), k

  4.  Find P(m+1) by solving (P1) for given {P(m),A(m),Q(m)}

  5.  Update X using (15), and find A(m+1) by solving (P2) iteratively until convergence for given

       {P(m+1),A(m),Q(m)}

  6.  Update X using (15), and find Q(m+1) by solving (P3) iteratively until convergence for given

       {P(m+1),A(m+1),Q(m)}

  7. R¯knew=R¯k(P(m+1),A(m+1),Q(m+1)), k

  8.  Update mm+1

  9. until Convergence, |kKln(R¯knew)kKln(R¯kold)|<ϵ