The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion (Q1740089): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.amc.2017.07.024 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.amc.2017.07.024 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2735864499 / 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: Matrix completion via an alternating direction method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3444931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of matrix completion / 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: 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: On the rank minimization problem over a positive semidefinite linear matrix inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low rank matrix completion by alternating steepest descent methods / 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: A new gradient projection method for matrix completion / 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 / DOI
 
Property / DOI: 10.1016/J.AMC.2017.07.024 / rank
 
Normal rank

Latest revision as of 07:14, 11 December 2024

scientific article
Language Label Description Also known as
English
The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion
scientific article

    Statements

    The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion (English)
    0 references
    0 references
    0 references
    29 April 2019
    0 references
    two-stage iteration
    0 references
    alternating steepest descent algorithm
    0 references
    low-rank matrix completion
    0 references
    distance
    0 references
    0 references
    0 references

    Identifiers

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