A note on probably certifiably correct algorithms (Q1695210): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Exact Recovery in the Stochastic Block Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementarity and nondegeneracy in semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-dimensional analysis of semidefinite relaxations for sparse principal components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relax, No Need to Round / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tightness of the maximum likelihood semidefinite relaxation for angular synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum-of-squares proofs and the quest toward optimal algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of semidefinite programming for sensor network localization / rank
 
Normal rank

Latest revision as of 01:50, 15 July 2024

scientific article
Language Label Description Also known as
English
A note on probably certifiably correct algorithms
scientific article

    Statements

    Identifiers

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