Robust Adaptive Modified Newton Algorithm for Generalized Eigendecomposition and Its Application
- 979 Downloads
We propose a robust adaptive algorithm for generalized eigendecomposition problems that arise in modern signal processing applications. To that extent, the generalized eigendecomposition problem is reinterpreted as an unconstrained nonlinear optimization problem. Starting from the proposed cost function and making use of an approximation of the Hessian matrix, a robust modified Newton algorithm is derived. A rigorous analysis of its convergence properties is presented by using stochastic approximation theory. We also apply this theory to solve the signal reception problem of multicarrier DS-CDMA to illustrate its practical application. The simulation results show that the proposed algorithm has fast convergence and excellent tracking capability, which are important in a practical time-varying communication environment.
KeywordsNonlinear Optimization Hessian Matrix Stochastic Approximation Adaptive Modify Nonlinear Optimization Problem
- 6.Ouyang S, Ching PC, Lee T: Robust adaptive quasi-Newton algorithms for eigensubspace estimation. IEE Proceedings: Vision, Image and Signal Processing 2003,150(5):321-330. 10.1049/ip-vis:20030767Google Scholar
- 8.Golub GH, VanLoan CF: Matrix Computations. John Hopkins University Press, Baltimore, Md, USA; 1991.Google Scholar
This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.