(2012) considered using QR decomposition to simplify the updates, it is still time consuming with the time complexity O(r 6 + pr 2 ).
the total time complexity is O(r 6 +pr 2 ) and the step of updating R k is the bottleneck in the optimization process.