Low-Complexity Levenberg-Marquardt Algorithm For Tensor Canonical Polyadic Decomposition

This video program is a part of the Premium package:

Low-Complexity Levenberg-Marquardt Algorithm For Tensor Canonical Polyadic Decomposition


  • IEEE MemberUS $11.00
  • Society MemberUS $0.00
  • IEEE Student MemberUS $11.00
  • Non-IEEE MemberUS $15.00
Purchase

Low-Complexity Levenberg-Marquardt Algorithm For Tensor Canonical Polyadic Decomposition

0 views
  • Share
Create Account or Sign In to post comments
In this paper, we propose CPD-fLM++, a fast implementation of the Levenberg-Marquardt (LM) algorithm for the tensor canonical polyadic decomposition. The overall algorithmic framework follows exactly the LM approach, which enjoys locally a super-linear co
In this paper, we propose CPD-fLM++, a fast implementation of the Levenberg-Marquardt (LM) algorithm for the tensor canonical polyadic decomposition. The overall algorithmic framework follows exactly the LM approach, which enjoys locally a super-linear co