Guarantees of Riemannian Optimization for Low Rank Matrix Recovery (Q2818273): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q115246964, #quickstatements; #temporary_batch_1712186161777
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / arXiv ID
 
Property / arXiv ID: 1511.01562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5433140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blind Deconvolution Using Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Living on the edge: phase transitions in convex programs with random data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex multi-task feature learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugate Gradient Iterative Hard Thresholding: Observed Noise Stability for Compressed Sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative hard thresholding for compressed sensing / 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: Robust Low-Rank Matrix Completion by Riemannian Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The restricted isometry property and its implications for compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phase Retrieval via Matrix Completion / 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: Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements / 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 uncertainty principles: exact signal reconstruction from highly incomplete frequency information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Convex Relaxation: Near-Optimal Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3444931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of fixed-point continuation algorithms for matrix rank minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4917542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovering Low-Rank Matrices From Few Coefficients in Any Basis / 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: Stable low-rank matrix recovery via null space properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Completion From a Few Entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2896128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix recipes for hard thresholding methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: ADMiRA: Atomic Decomposition for Minimum Rank Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-Point Method for Nuclear Norm Approximation with Application to System Identification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-rank matrix factorizations and Riemannian low-rank optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Riemannian Preconditioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simpler Approach to Matrix Completion / 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: Null space conditions and thresholds for rank minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guaranteed Matrix Completion via Non-Convex Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normalized Iterative Hard Thresholding for Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low rank matrix completion by alternating steepest descent methods / 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: Solving systems of phaseless equations via Kaczmarz methods: a proof of concept study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarantees of Riemannian Optimization for Low Rank Matrix Recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The local convexity of solving systems of quadratic equations / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964014592 / rank
 
Normal rank

Latest revision as of 10:33, 30 July 2024

scientific article
Language Label Description Also known as
English
Guarantees of Riemannian Optimization for Low Rank Matrix Recovery
scientific article

    Statements

    Guarantees of Riemannian Optimization for Low Rank Matrix Recovery (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    7 September 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    matrix recovery
    0 references
    low rank matrix manifold
    0 references
    Riemannian optimization
    0 references
    gradient descent method
    0 references
    conjugate gradient descent method
    0 references
    restricted isometry constant
    0 references
    algorithm
    0 references
    low rank matrix
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references