Skip to main content
. 2019 Apr 10;19(7):1718. doi: 10.3390/s19071718
Algorithm 2 FBS algorithm for GMC penalized least squares problem
Input: x(0),v(0),A,AT,λ
Output: x(i+1)
  • 1:

    Set ρ=max{1,γ/(1γ)}·maxeig(ATA)

  • 2:

    Set μ:0<μ<2/ρ

  • 3:

    Number of iteration: Niter

  • 4:

    for i=0toNiterdo

  • 5:

    w(i)=x(i)μAT(Ax(i)dw)+μγATA(v(i)x(i))

  • 6:

    u(i)=v(i)μγATA(v(i)x(i))

  • 7:

    x(i+1)=soft(w(i),μλ)

  • 8:

    v(i+1)=soft(u(i),μλ)

  • 9:

    end for

  • 10:

    return x(i+1)