Invexity of the Minimum Error Entropy Criterion

In this letter, optimization properties of Minimization of Error Entropy (MEE) and Minimization of Error Entropy with Fiducial points (MEEF) are presented. It is proved that by varying the kernel parameter of the MEE and/or MEEF objective function, the resulting problem, in general leads to an invex problem. Furthermore, for certain values of the kernel parameter it is shown that the problems may transform to convex or pseudo-convex problems.