Using Computer Algebra to Certify the Global Convergence of a Numerical Optimization Process

The basic objective of blind signal separation is to recover a set of source signals from a set of observations that are mixtures of the sources with no, or very limited knowledge about the mixture structure and source signals. To extract the original sources, many algorithms have been proposed; among them, the cross-correlation and constant modulus algorithm (CC-CMA) appears to be the algorithm of choice due to its computational simplicity.

An important issue in CC-CMA algorithm is the global convergence analysis, because the cost function is not quadratic nor convex and contains undesirable stationary points. If these undesirable points are local minimums, the convergence of the algorithm may not be guaranteed and the CC-CMA would fail to separate source signals.

The main result of this paper is to complete the classification of these stationary points and to prove that they are not local minimums unless if the mixing parameter is equal to 1.

This is obtained by using the theory of discriminant varieties to determine the stationnary points as a function of the parameter and then to show that the Hessian matrix of the cost function is not positive semidefinite at these stationnay points, unless if the mixing parameter is 1.

Authors and Affiliations

1. School of Engineering and Information Technology, Deakin University, Geelong, VIC, 3217, Australia

   Nong Gu & Yong Xiang

2. SALSA Project INRIA Paris-Rocquencourt and LIP6, University Paris VI and CNRS, 104, Av. du Président Kennedy, F-75016, Paris, France

   Daniel Lazard & Fabrice Rouillier

Corresponding author

Correspondence to Daniel Lazard.

Reprints and permissions