A novel low-rank matrix completion approach to estimate missing entries in Euclidean distance matrix (Q1993487): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Assigned and unassigned distance geometry: applications to biological molecules and nanostructures / 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: Affine matrix rank minimization problem via non-convex fraction function penalty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean Distance Geometry and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2896145 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank

Revision as of 05:48, 17 July 2024

scientific article
Language Label Description Also known as
English
A novel low-rank matrix completion approach to estimate missing entries in Euclidean distance matrix
scientific article

    Statements

    Identifiers

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