Modified steepest descent and Newton algorithms for orthogonally constrained optimisation. Part I. The complex Stiefel manifold
暂无分享,去创建一个
[1] Jonathan H. Manton. Modified steepest descent and Newton algorithms for orthogonally constrained optimisation. Part II. The complex Grassmann manifold , 2001, Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467).
[2] Elijah Polak,et al. Optimization: Algorithms and Consistent Approximations , 1997 .
[3] Alan Edelman,et al. The Geometry of Algorithms with Orthogonality Constraints , 1998, SIAM J. Matrix Anal. Appl..
[4] Benoît Champagne,et al. Plane rotation-based EVD updating schemes for efficient subspace tracking , 1998, IEEE Trans. Signal Process..
[5] Daniel J. Rabideau,et al. Fast, rank adaptive subspace tracking and applications , 1996, IEEE Trans. Signal Process..
[6] Robert E. Mahony,et al. The geometry of weighted low-rank approximations , 2003, IEEE Trans. Signal Process..
[7] Donald W. Tufts,et al. Two algorithms for fast approximate subspace tracking , 1999, IEEE Trans. Signal Process..
[8] J. Magnus,et al. Matrix Differential Calculus with Applications in Statistics and Econometrics , 1991 .
[9] A. V. D. Veen. Algebraic methods for deterministic blind beamforming , 1998, Proc. IEEE.
[10] Lang Tong,et al. Indeterminacy and identifiability of blind identification , 1991 .
[11] Eric Moulines,et al. A blind source separation technique using second-order statistics , 1997, IEEE Trans. Signal Process..