Global convergence analysis for the NIC flow

Previously, a family of fast subspace tracking algorithms based on a novel information criterion (NIC) has been proposed and investigated. It is known that these new algorithms are associated with a new kind of flow, which is called the NIC flow in this paper as in the case of the conventional Oja subspace algorithms with the Oja flow. In this paper, some fundamental questions about this new NIC flow such as its solution existence and convergence, are investigated. In addition, the convergence domain is characterized. Some important results on these issues are obtained via manifold theory

Citation

Liu, Wan-Quan and Yan, W. and Sreeram, V. and Teo, Kok Lay. 2001. Global convergence analysis for the NIC flow. IEEE Transactions on Signal Processing. 49 (10): pp. 2422-2430.

Source Title

IEEE Transactions on Signal Processing

DOI

10.1109/78.950796

ISSN

1053587X

Faculty

School of Electrical Engineering and Computing

Department of Computing

Faculty of Science and Engineering

Remarks

Copyright © 2001 IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

URI

http://hdl.handle.net/20.500.11937/39871

Collection

Curtin Research Publications