Author:
Nishimori Yasunori,Akaho Shotaro,Plumbley Mark D.
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Abrudan, T., Eriksson, J., Koivunen, V.: Steepest Descent Algorithms for Optimization under Unitary Matrix Constraint (preprint)
2. Adali, T., Li, H.: A practical formulation for computation of complex gradients and its application to maximum likelihood. In: Proc. IEEE Int. Conf. Acoust., Speech, Signal Processing (ICASSP), Honolulu, Hawaii (April 2007)
3. Amari, S.: Natural gradient works efficiently in learning. Neural Computation 10, 251–276 (1998)
4. Brandwood, D.H.: A Complex Gradient Operator and its Application in Adaptive Array Theory. IEE Proceedings H (Microwaves, Optics, and Antennas) 130(1), 11–16 (1983)
5. Edelman, A., Arias, T.A., Smith, S.T.: The geometry of algorithms with orthogonality constraints. SIAM Journal on Matrix Analysis and Applications 20(2), 303–353 (1998)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Practical gradient and conjugate gradient methods on flag manifolds;Computational Optimization and Applications;2024-03-19
2. Chordal Averaging on Flag Manifolds and Its Applications;2023 IEEE/CVF International Conference on Computer Vision (ICCV);2023-10-01
3. Extrinsic Bayesian Optimization on Manifolds;Algorithms;2023-02-15
4. The Flag Manifold as a Tool for Analyzing and Comparing Sets of Data Sets;2021 IEEE/CVF International Conference on Computer Vision Workshops (ICCVW);2021-10
5. Optimization on flag manifolds;Mathematical Programming;2021-06-23