Finding a low-rank basis in a matrix subspace
From MaRDI portal
Publication:517309
DOI10.1007/s10107-016-1042-2zbMath1358.90107arXiv1503.08601OpenAlexW350696896MaRDI QIDQ517309
Tasuku Soma, Yuji Nakatsukasa, André Uschmajew
Publication date: 23 March 2017
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.08601
alternating projectionsmatrix compressionsingular value thresholding\(\ell ^1\) relaxationlow-rank matrix subspace
Related Items
On the spectral problem for trivariate functions, On Uniqueness and Computation of the Decomposition of a Tensor into Multilinear Rank-$(1,L_r,L_r)$ Terms, A Riemannian Gradient Sampling Algorithm for Nonsmooth Optimization on Manifolds, Unnamed Item, A novel method of dynamic force identification and its application, Robust and resource-efficient identification of two hidden layer neural networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- On local convergence of the method of alternating projections
- Alternating projections on nontangential manifolds
- An implementable proximal point algorithmic framework for nuclear norm minimization
- Statistics for high-dimensional data. Methods, theory and applications.
- Nuclear norm minimization for the planted clique and biclique problems
- Local linear convergence for alternating and averaged nonconvex projections
- Transversality and alternating projections for nonconvex sets
- The restricted isometry property and its implications for compressed sensing
- Critical points of matrix least squares distance functions
- Classical complexity and quantum entanglement
- Some convergence results on the regularized alternating least-squares method for tensor decomposition
- Musings on multilinear fitting
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Exact matrix completion via convex optimization
- Matrix Algorithms
- A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
- Local Convergence of the Alternating Least Squares Algorithm for Canonical Tensor Approximation
- Canonical Polyadic Decomposition of Third-Order Tensors: Reduction to Generalized Eigenvalue Decomposition
- On the Global Convergence of the Alternating Least Squares Method for Rank-One Approximation to Generic Tensors
- A new convergence proof for the higher-order power method and generalizations
- Generalized Wong sequences and their applications to Edmonds' problems
- Finding a Sparse Vector in a Subspace: Linear Sparsity Using Alternating Directions
- Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture
- Complete Dictionary Recovery Over the Sphere II: Recovery by Riemannian Trust-Region Method
- A Singular Value Thresholding Algorithm for Matrix Completion
- A Decomposition for Three-Way Arrays
- Tensor rank is NP-complete
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- The complexity of matrix completion
- Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- The Null Space Problem I. Complexity
- Singular spaces of matrices and their application in combinatorics
- A Multilinear Singular Value Decomposition
- Templates for the Solution of Algebraic Eigenvalue Problems
- Scaling law for recovering the sparsest element in a subspace
- Computation of the Canonical Decomposition by Means of a Simultaneous Generalized Schur Decomposition
- Rounding sum-of-squares relaxations
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- A Link between the Canonical Decomposition in Multilinear Algebra and Simultaneous Matrix Diagonalization
- Decompositions of a Higher-Order Tensor in Block Terms—Part II: Definitions and Uniqueness
- Blind Separation of Image Sources via Adaptive Dictionary Learning
- Alternating Projections on Manifolds
- Most Tensor Problems Are NP-Hard
- A Simpler Approach to Matrix Completion
- News Algorithms for tensor decomposition based on a reduced functional
- Systems of distinct representatives and linear algebra
- Perturbation bounds in connection with singular value decomposition
