Skip to main content
. 2019 Feb 24;19(4):955. doi: 10.3390/s19040955
Algorithm A1. Steps of optimization for variational mode decomposition.
Initilize {u^p1},{ωp1},λ^1,n0repeat
   nn+1for p=1:P do   Update u^p for all ω0:
          u^pn+1(ω)x^(ω)i<pu^in+1(ω)i>pu^in(ω)+λ^n(ω)21+2α(ωωpn)2
       Update ωp:   ωpn+10ω|u^pn+1(ω)|2dω0|u^pn+1(ω)|2dω
   end forDual ascent for all ω0:λ^n+1(ω)λ^n(ω)+τ(x^(ω)pu^pn+1(ω))
until convergence:p=1Pu^pn+1u^pn22/u^p22<ε