A rank-corrected procedure for matrix completion with fixed basis coefficients (Q312678): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / author
 
Property / author: Defeng Sun / rank
 
Normal rank
Property / review text
 
The authors consider the matrix completion problem as well as an adaptive nuclear semi-norm technique for its solution. In particular, they propose a rank-corrected procedure which uses a nuclear semi-norm for generating a new estimator. Here, they quantify the reduction of the recovery error bound. Finally, several numerical experiments illustrate the presented results.
Property / review text: The authors consider the matrix completion problem as well as an adaptive nuclear semi-norm technique for its solution. In particular, they propose a rank-corrected procedure which uses a nuclear semi-norm for generating a new estimator. Here, they quantify the reduction of the recovery error bound. Finally, several numerical experiments illustrate the presented results. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Jan-Joachim Rückmann / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C90 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6627814 / rank
 
Normal rank
Property / zbMATH Keywords
 
matrix completion
Property / zbMATH Keywords: matrix completion / rank
 
Normal rank
Property / zbMATH Keywords
 
fixed basis coefficients
Property / zbMATH Keywords: fixed basis coefficients / rank
 
Normal rank
Property / zbMATH Keywords
 
low-rank
Property / zbMATH Keywords: low-rank / rank
 
Normal rank
Property / zbMATH Keywords
 
convex optimization
Property / zbMATH Keywords: convex optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
rank consistency
Property / zbMATH Keywords: rank consistency / rank
 
Normal rank
Property / zbMATH Keywords
 
constraint nondegeneracy
Property / zbMATH Keywords: constraint nondegeneracy / rank
 
Normal rank

Revision as of 01:19, 28 June 2023

scientific article
Language Label Description Also known as
English
A rank-corrected procedure for matrix completion with fixed basis coefficients
scientific article

    Statements

    A rank-corrected procedure for matrix completion with fixed basis coefficients (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 September 2016
    0 references
    The authors consider the matrix completion problem as well as an adaptive nuclear semi-norm technique for its solution. In particular, they propose a rank-corrected procedure which uses a nuclear semi-norm for generating a new estimator. Here, they quantify the reduction of the recovery error bound. Finally, several numerical experiments illustrate the presented results.
    0 references
    0 references
    matrix completion
    0 references
    fixed basis coefficients
    0 references
    low-rank
    0 references
    convex optimization
    0 references
    rank consistency
    0 references
    constraint nondegeneracy
    0 references