Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix Completion (Q5251927): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2001114276 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1404.1377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex multi-task feature learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096144 / 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: Exact matrix completion via convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on greedy algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2781937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Approximate Solutions to Semidefinite Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-rank matrix completion using alternating minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: ADMiRA: Atomic Decomposition for Minimum Rank Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implementable proximal point algorithmic framework for nuclear norm minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed point and Bregman iterative methods for matrix rank minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2896145 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-Rank Optimization with Trace Norm Penalty / rank
 
Normal rank
Property / cites work
 
Property / cites work: CoSaMP: Iterative signal recovery from incomplete and inaccurate samples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation of (near) low-rank matrices with noise and high-dimensional scaling / 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: Parallel stochastic gradient algorithms for large-scale matrix completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3161693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greed is Good: Algorithmic Results for Sparse Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinate descent algorithms for lasso penalized regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization / rank
 
Normal rank

Latest revision as of 02:31, 10 July 2024

scientific article; zbMATH DE number 6438327
Language Label Description Also known as
English
Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix Completion
scientific article; zbMATH DE number 6438327

    Statements

    Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix Completion (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    21 May 2015
    0 references
    low rank
    0 references
    singular value decomposition
    0 references
    rank minimization
    0 references
    matrix completion
    0 references
    matching pursuit
    0 references
    algorithm
    0 references
    convergence
    0 references
    numerical result
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references