Method of stochastic approximation in the determination of the largest eigenvalue of the mathematical expectation of random matrices
From MaRDI portal
Publication:2550599
zbMath0231.62099MaRDI QIDQ2550599
Publication date: 1970
Published in: Automation and Remote Control (Search for Journal in Brave)
Related Items
Online sparse sliced inverse regression for high-dimensional streaming data, Convergence analysis of Oja's iteration for solving online PCA with nonzero-mean samples, Oja's algorithm for graph clustering, Markov spectral decomposition, and risk sensitive control, Online Principal Component Analysis in High Dimension: Which Algorithm to Choose?, Widening the scope of an eigenvector stochastic approximation process and application to streaming PCA and related methods, Application of differential equations to synthesize a class of algorithms for numerical solution of a partial eigenvalue problem, Analyzing iterations in identification with application to nonparametric \(\mathcal H_{\infty}\)-norm estimation, Stochastic approximation of the factors of a generalized canonical correlation analysis, Concentration inequalities for random matrix products, Analysis of a stochastic approximation algorithm for computing quasi-stationary distributions, On stochastic approximation of the eigenvectors and eigenvalues of the expectation of a random matrix
