On dertermining mixing parameter of CC-CMA algorithm by solving semi-algebraic sets - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2006

On dertermining mixing parameter of CC-CMA algorithm by solving semi-algebraic sets

Abstract

The global convergence of a recently proposed constant modulus (CM) and cross-correlation (CC)-based algorithm (CC-CMA) is studied in this paper. We first show the original analysis of global convergence of CC-CMA is incorrect. We then point out that the global convergent analysis of gradient stochastic algorithms including CC-CMA could be completed by solving a semi-algebraic set. By developing an optimal algorithm to examine the roots distribution a semi-algebraic set related with CC-CMA, we present that CC-CMA can converge globally if the parameter which mix the CM and CC terms is properly selected. Since our approach is quite general, it can be extended to the convergence analysis of any gradient stochastic algorithm. Simulation results confirm the theoretical analysis on the conditions of mixing parameter.
Fichier principal
Vignette du fichier
RR-5830.pdf (391.76 Ko) Télécharger le fichier

Dates and versions

inria-00070195 , version 1 (19-05-2006)

Identifiers

  • HAL Id : inria-00070195 , version 1

Cite

Nong Gu, Daniel Lazard, Fabrice Rouillier, Yong Xiang. On dertermining mixing parameter of CC-CMA algorithm by solving semi-algebraic sets. [Research Report] RR-5830, INRIA. 2006, pp.27. ⟨inria-00070195⟩
184 View
17104 Download

Share

Gmail Facebook Twitter LinkedIn More