Computational and statistical tradeoffs via convex relaxation (Q5170958): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: De-noising by soft-thresholding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax estimation via wavelet shrinkage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational sample complexity and attribute-efficient learning / 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: Orthogonal Tensor Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Consistency and Sparsity for Principal Components Analysis in High Dimensions / 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: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for semialgebraic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theta Bodies for Polynomial Ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperbolic programs, and their derivative relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sizes of compact subsets of Hilbert space and continuity of Gaussian processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The convex geometry of linear inverse problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: ORBITOPES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the nearest correlation matrix--a problem from finance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularized estimation of large covariance matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4705344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding and certifying a large hidden clique in a semirandom graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nuclear norm minimization for the planted clique and biclique problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd Minimum Cut-Sets and <i>b</i>-Matchings / rank
 
Normal rank

Latest revision as of 19:56, 8 July 2024

scientific article; zbMATH DE number 6321187
Language Label Description Also known as
English
Computational and statistical tradeoffs via convex relaxation
scientific article; zbMATH DE number 6321187

    Statements

    Computational and statistical tradeoffs via convex relaxation (English)
    0 references
    0 references
    0 references
    25 July 2014
    0 references
    0 references
    0 references
    0 references

    Identifiers

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