scientific article; zbMATH DE number 6982338
From MaRDI portal
Juliane Sigl, Christian Kümmerle
Publication date: 21 November 2018
Full work available at URL: https://arxiv.org/abs/1703.05038
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
matrix completionnon-convex optimizationiteratively reweighted least squareslow-rank matrix recovery
Related Items
Approximation, Gelfand, and Kolmogorov numbers of Schatten class embeddings, GNMR: A Provable One-Line Algorithm for Low Rank Matrix Recovery, Gelfand numbers of embeddings of Schatten classes, An adaptation for iterative structured matrix completion, Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries, Proof methods for robust low-rank matrix recovery
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- A quadratically convergent algorithm for structured low-rank approximation
- Conjugate gradient acceleration of iteratively re-weighted least squares methods
- A mathematical introduction to compressive sensing
- Uniqueness conditions for low-rank matrix recovery
- Null space conditions and thresholds for rank minimization
- Perturbation of the SVD in the presence of small singular values
- Low rank matrix completion by alternating steepest descent methods
- Stability of low-rank matrix recovery and its connections to Banach space geometry
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Matrix recipes for hard thresholding methods
- A partial derandomization of phaselift using spherical designs
- Nuclear norm system identification with missing inputs and outputs
- Exact matrix completion via convex optimization
- Guarantees of Riemannian Optimization for Low Rank Matrix Recovery
- PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
- Low-Rank Matrix Completion by Riemannian Optimization
- Normalized Iterative Hard Thresholding for Matrix Completion
- Guaranteed Matrix Completion via Non-Convex Factorization
- Phase Retrieval via Wirtinger Flow: Theory and Algorithms
- Compressive Multiplexing of Correlated Signals
- Concave Mirsky Inequality and Low-Rank Recovery
- Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization
- Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Iteratively reweighted least squares minimization for sparse recovery
- CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
- Stable low-rank matrix recovery via null space properties
- The phase transition of matrix recovery from Gaussian measurements matches the minimax MSE of matrix denoising
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- Low-Rank Optimization with Trace Norm Penalty
- Low-rank matrix completion using alternating minimization
- Solution of the Equation $AX + XB = C$ by Inversion of an $M \times M$ or $N \times N$ Matrix
- Perturbation bounds in connection with singular value decomposition
- The Algebraic Combinatorial Approach for Low-Rank Matrix Completion
- Phase Retrieval via Matrix Completion
- Direct methods in the calculus of variations
- Traces and determinants of linear operators
