An Equivalence between Critical Points for Rank Constraints Versus Low-Rank Factorizations (Q5131960): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5433140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast global convergence of gradient methods for high-dimensional statistical recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient descent with non-convex constraints: local concavity determines convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact matrix completion via convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust principal component analysis? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phase Retrieval via Wirtinger Flow: Theory and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-Sparsity Incoherence for Matrix Decomposition / 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 Completion From a Few Entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-Rank Optimization with Trace Norm Penalty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted strong convexity and weighted matrix completion: Optimal bounds with noise / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp Time–Data Tradeoffs for Linear Inverse Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variational Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Bound of Hard Thresholding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Methods on Low-Rank Matrix and Tensor Manifolds / 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: Q4558490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp Restricted Isometry Bounds for the Inexistence of Spurious Local Minima in Nonconvex Matrix Recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimality in Low-Rank Matrix Optimization / rank
 
Normal rank

Revision as of 00:04, 24 July 2024

scientific article; zbMATH DE number 7271850
Language Label Description Also known as
English
An Equivalence between Critical Points for Rank Constraints Versus Low-Rank Factorizations
scientific article; zbMATH DE number 7271850

    Statements

    An Equivalence between Critical Points for Rank Constraints Versus Low-Rank Factorizations (English)
    0 references
    0 references
    0 references
    0 references
    9 November 2020
    0 references
    low-rank optimization
    0 references
    projected gradient descent
    0 references
    Burer-Monteiro factorization
    0 references
    0 references
    0 references
    0 references

    Identifiers