LAUSR

Correntropy as an efficient information theoretic (ITL) criterion has been extensively applied in many non-Gaussian applications. In order to maximize correntropy, several optimization algorithms have been proposed. Fixed-point maximum correntropy (FP-MCC) and correntropy-based Levenberg–Marquardt (CLM) are the fastest of the proposed methods. As the convergence rate of these operational methods has not been studied before, in this paper we prove the ability of their quadratic convergence from a theoretic point of view and establish the influence of bandwidth on their convergence order. Then, theoretic results are validated through numerical experiments.