Minimum \( n\)-rank approximation via iterative hard thresholding (Q299732): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1311.4291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex multi-task feature learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-Point Method for Nuclear Norm Approximation with Application to System Identification / 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: Exact matrix completion via convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Completion From a Few Entries / 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: Subspace Evolution and Transfer (SET) for Low-Rank 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: Tensor completion and low-n-rank tensor recovery via convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning with tensors: a framework based on convex optimization and spectral regularization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fixed Point Iterative Method for Low $n$-Rank Tensor Pursuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2941675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Low-Rank Tensor Recovery: Models and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Best Rank-1 and Rank-(<i>R</i><sub>1</sub> ,<i>R</i><sub>2</sub> ,. . .,<i>R<sub>N</sub></i>) Approximation of Higher-Order Tensors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative thresholding for sparse approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative hard thresholding for compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix recipes for hard thresholding methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor Completion in Hierarchical Tensor Representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix / 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: An iterative algorithm for third-order tensor multi-rank minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted $p$-Isometry Properties of Nonconvex Matrix Recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reweighted nuclear norm minimization algorithm for low rank matrix recovery / rank
 
Normal rank

Latest revision as of 05:51, 12 July 2024

scientific article
Language Label Description Also known as
English
Minimum \( n\)-rank approximation via iterative hard thresholding
scientific article

    Statements

    Minimum \( n\)-rank approximation via iterative hard thresholding (English)
    0 references
    0 references
    0 references
    0 references
    22 June 2016
    0 references
    0 references
    iterative hard thresholding
    0 references
    low-\( n\)-rank tensor recovery
    0 references
    tensor completion
    0 references
    compressed sensing
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references