Matrix approximation by a sum of matrix products
From MaRDI portal
Cites work
- A general formulation of alternating direction methods. I: Parabolic and hyperbolic problems
- Abstract Optimal Linear Filtering
- Alternating methods for sets of linear equations
- Alternating minimal energy methods for linear systems in higher dimensions
- Alternating stationary iterative methods based on double splittings
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Coordinate descent algorithms
- Distributed State Estimation With Dimension Reduction Preprocessing
- Fast monte-carlo algorithms for finding low-rank approximations
- First-order methods in optimization
- Generalized Rank-Constrained Matrix Approximations
- MIMO system identification: State-space and subspace approximations versus transfer function and instrumental variables
- Nonlinear programming
- On passing to the limit by the alternating process.
- Optimal CUR matrix decompositions
- Prediction by Supervised Principal Components
- Principal component analysis: a review and recent developments
- Rank constrained matrix best approximation problem
- Rank constrained matrix best approximation problem with respect to (skew) Hermitian matrices
- Reduced rank linear regression and weighted low rank approximations
- Sampling and Interpolation Problems for Vector Valued Signals in the Paley–Wiener Spaces
- Statistics for high-dimensional data. Methods, theory and applications.
- The approximation of one matrix by another of lower rank.
- The method of alternating projections and the method of subspace corrections in Hilbert space
- Time series. Data analysis and theory.
- Towards theory of generic principal component analysis
This page was built for publication: Matrix approximation by a sum of matrix products
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7288328)
