Proof methods for robust low-rank matrix recovery (Q2106469)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Proof methods for robust low-rank matrix recovery	scientific article

Statements

scholarly article

0 references

Proof methods for robust low-rank matrix recovery (English)

0 references

0 references

0 references

0 references

0 references

0 references

Dominik Stöger

0 references

publication date

14 December 2022

0 references

full work available at URL

https://arxiv.org/abs/2106.04382

0 references

zbMATH Keywords

low-rank matrix recovery problems

0 references

reconstruction performance

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

Blind Deconvolution Using Convex Programming

0 references

Living on the edge: phase transitions in convex programs with random data

0 references

Convex multi-task feature learning

0 references

Painless reconstruction from magnitudes of frame coefficients

0 references

0 references

A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization

0 references

Optimal rates of convergence for noisy sparse phase retrieval via thresholded Wirtinger flow

0 references

Phase Retrieval via Matrix Completion

0 references

Solving quadratic equations via phaselift when there are about as many equations as unknowns

0 references

Phase retrieval from coded diffraction patterns

0 references

Phase Retrieval via Wirtinger Flow: Theory and Algorithms

0 references

A Probabilistic and RIPless Theory of Compressed Sensing

0 references

Exact matrix completion via convex optimization

0 references

Stable signal recovery from incomplete and inaccurate measurements

0 references

PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming

0 references

Decoding by Linear Programming

0 references

The Power of Convex Relaxation: Near-Optimal Matrix Completion

0 references

The convex geometry of linear inverse problems

0 references

Incoherence-Optimal Matrix Completion

0 references

Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems

0 references

Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization

0 references

An algebraic characterization of injectivity in phase retrieval

0 references

Phase retrieval: stability and recovery guarantees

0 references

Non-Bayesian Activity Detection, Large-Scale Fading Coefficient Estimation, and Unsourced Random Access With a Massive MIMO Receiver

0 references

Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization

0 references

A mathematical introduction to compressive sensing

0 references

Sparse power factorization: balancing peakiness and sample complexity

0 references

0 references

Recovering Low-Rank Matrices From Few Coefficients in Any Basis

0 references

A partial derandomization of phaselift using spherical designs

0 references

Improved recovery guarantees for phase retrieval from coded diffraction patterns

0 references

Low-rank matrix completion using alternating minimization

0 references

Localization from incomplete noisy distance measurements

0 references

Blind Demixing and Deconvolution at Near-Optimal Rate

0 references

Stable low-rank matrix recovery via null space properties

0 references

Explicit frames for deterministic phase retrieval via PhaseLift

0 references

Optimal Injectivity Conditions for Bilinear Inverse Problems with Applications to Identifiability of Deconvolution Problems

0 references

Matrix Completion From a Few Entries

0 references

0 references

Noisy low-rank matrix completion with general sampling distribution

0 references

Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion

0 references

Bounding the Smallest Singular Value of a Random Matrix Without Concentration

0 references

Phase Retrieval Without Small-Ball Probability Assumptions

0 references

Suprema of Chaos Processes and the Restricted Isometry Property

0 references

On the Convex Geometry of Blind Deconvolution and Matrix Completion

0 references

Complex phase retrieval from subgaussian measurements

0 references

Robust Nonnegative Sparse Recovery and the Nullspace Property of 0/1 Measurements

0 references

Low rank matrix recovery from rank one measurements

0 references

0 references

Blind Recovery of Sparse Signals From Subsampled Convolution

0 references

Identifiability in Bilinear Inverse Problems With Applications to Subspace or Sparsity-Constrained Blind Gain and Phase Calibration

0 references

Blind Deconvolution Meets Blind Demixing: Algorithms and Performance Bounds

0 references

Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution

0 references

Learning without Concentration

0 references

Sparse Approximate Solutions to Linear Systems

0 references

Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices

0 references

A Simpler Approach to Matrix Completion

0 references

Guaranteed Matrix Completion via Non-Convex Factorization

0 references

User-friendly tail bounds for sums of random matrices

0 references

Convex Recovery of a Structured Signal from Independent Random Linear Measurements

0 references

Practical Sketching Algorithms for Low-Rank Matrix Approximation

0 references

Characterization of the subdifferential of some matrix norms

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-031-09745-4_2

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2106469

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2106469&oldid=37472400"