Harmonic mean iteratively reweighted least squares for low-rank matrix recovery
From MaRDI portal
Publication:4558196
Authors: Christian Kümmerle, Juliane Sigl 
Publication date: 21 November 2018
Full work available at URL: https://arxiv.org/abs/1703.05038
Recommendations
- Convergence and stability of iteratively reweighted least squares for low-rank matrix recovery
- Low-rank matrix recovery via iteratively reweighted least squares minimization
- scientific article; zbMATH DE number 6276219
- A singular value \(p\)-shrinkage thresholding algorithm for low rank matrix recovery
- Proximal iteratively reweighted algorithm for low-rank matrix recovery
matrix completionnon-convex optimizationlow-rank matrix recoveryiteratively reweighted least squares
Cites Work
- Phaselift: exact and stable signal recovery from magnitude measurements via convex programming
- Phase retrieval via Wirtinger flow: theory and algorithms
- Phase retrieval via matrix completion
- Title not available (Why is that?)
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Exact matrix completion via convex optimization
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- Perturbation bounds in connection with singular value decomposition
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- A mathematical introduction to compressive sensing
- Matrix mathematics. Theory, facts, and formulas
- The algebraic combinatorial approach for low-rank matrix completion
- Iteratively reweighted least squares minimization for sparse recovery
- Direct methods in the calculus of variations
- Low-rank matrix completion by Riemannian optimization
- Solution of the Equation $AX + XB = C$ by Inversion of an $M \times M$ or $N \times N$ Matrix
- A quadratically convergent algorithm for structured low-rank approximation
- Interior-point method for nuclear norm approximation with application to system identification
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- Low-rank matrix completion using alternating minimization
- Traces and determinants of linear operators
- Matrix recipes for hard thresholding methods
- Low-rank matrix recovery via iteratively reweighted least squares minimization
- Nuclear norm system identification with missing inputs and outputs
- Conjugate gradient acceleration of iteratively re-weighted least squares methods
- Stable low-rank matrix recovery via null space properties
- Title not available (Why is that?)
- A partial derandomization of phaselift using spherical designs
- The phase transition of matrix recovery from Gaussian measurements matches the minimax MSE of matrix denoising
- Null space conditions and thresholds for rank minimization
- Uniqueness conditions for low-rank matrix recovery
- Normalized iterative hard thresholding for matrix completion
- Low-rank optimization with trace norm penalty
- Guaranteed Matrix Completion via Non-Convex Factorization
- Perturbation of the SVD in the presence of small singular values
- CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
- Low rank matrix completion by alternating steepest descent methods
- Guarantees of Riemannian optimization for low rank matrix recovery
- Stability of low-rank matrix recovery and its connections to Banach space geometry
- Compressive Multiplexing of Correlated Signals
- Concave Mirsky inequality and low-rank recovery
Cited In (9)
- Convergence and stability of iteratively reweighted least squares for low-rank matrix recovery
- An adaptation for iterative structured matrix completion
- Approximation, Gelfand, and Kolmogorov numbers of Schatten class embeddings
- Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries
- GNMR: a provable one-line algorithm for low rank matrix recovery
- Gelfand numbers of embeddings of Schatten classes
- Low-rank matrix recovery via iteratively reweighted least squares minimization
- Harmonic Mean Iteratively Reweighted Least Squares for Low-Rank Matrix Recovery
- Proof methods for robust low-rank matrix recovery
Uses Software
This page was built for publication: Harmonic mean iteratively reweighted least squares for low-rank matrix recovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4558196)
