Low rank matrix completion by alternating steepest descent methods (Q905914): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
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.1016/j.acha.2015.08.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1548998364 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion / 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: The Power of Convex Relaxation: Near-Optimal Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3444931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3172946 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally convergent block-coordinate techniques for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of matrix completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Completion From a Few Entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix recipes for hard thresholding methods / 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: Fixed-rank matrix factorizations and Riemannian low-rank optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normalized Iterative Hard Thresholding for Matrix Completion / 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: 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: 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, 11 July 2024

scientific article
Language Label Description Also known as
English
Low rank matrix completion by alternating steepest descent methods
scientific article

    Statements

    Low rank matrix completion by alternating steepest descent methods (English)
    0 references
    0 references
    0 references
    28 January 2016
    0 references
    matrix completion
    0 references
    alternating minimization
    0 references
    gradient descent
    0 references
    exact line-search
    0 references
    0 references
    0 references

    Identifiers

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