Nonnegative Low Rank Matrix Completion by Riemannian Optimalization Methods (Q6191800): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.4208/aam.oa-2023-0010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4380792218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact matrix completion via convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Convex Relaxation: Near-Optimal Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust principal component analysis? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovering Low-Rank Matrices From Few Coefficients in Any Basis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simpler Approach to Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-Rank Matrix Completion by Riemannian Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarantees of Riemannian Optimization for Low Rank Matrix Recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Cadzow's algorithm and a gradient variant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of fixed-point continuation algorithms for matrix rank minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Singular Value Thresholding Algorithm for Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarantees of Riemannian optimization for low rank matrix completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated Alternating Projections for Robust Principal Component Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning the parts of objects by non-negative matrix factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4438855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introducing a weighted non-negative matrix factorization for image classification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Preconditioning Techniques and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An alternating direction algorithm for matrix completion with nonnegative factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion / rank
 
Normal rank

Latest revision as of 09:05, 28 August 2024

scientific article; zbMATH DE number 7814782
Language Label Description Also known as
English
Nonnegative Low Rank Matrix Completion by Riemannian Optimalization Methods
scientific article; zbMATH DE number 7814782

    Statements

    Nonnegative Low Rank Matrix Completion by Riemannian Optimalization Methods (English)
    0 references
    0 references
    0 references
    11 March 2024
    0 references
    manifolds
    0 references
    tangent spaces
    0 references
    nonnegative matrices
    0 references
    low rank
    0 references
    0 references

    Identifiers