Median-Truncated Gradient Descent: A Robust and Scalable Nonconvex Approach for Signal Estimation (Q3296183)

scientific article

Language	Label	Description	Also known as
English	Median-Truncated Gradient Descent: A Robust and Scalable Nonconvex Approach for Signal Estimation	scientific article

Statements

instance of

scholarly article

0 references

title

Median-Truncated Gradient Descent: A Robust and Scalable Nonconvex Approach for Signal Estimation (English)

0 references

0 references

0 references

0 references

0 references

Applied and Numerical Harmonic Analysis

0 references

publication date

7 July 2020

0 references

describes a project that uses

Wirtinger Flow

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-73074-5_8

0 references

cites work

Guaranteed Matrix Completion via Non-Convex Factorization

0 references

Phase Retrieval via Wirtinger Flow: Theory and Algorithms

0 references

Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture

0 references

Rapid, robust, and reliable blind deconvolution via nonconvex optimization

0 references

Median-Truncated Nonconvex Approach for Phase Retrieval With Outliers

0 references

Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization

0 references

Recovering Low-Rank Matrices From Few Coefficients in Any Basis

0 references

Estimation of (near) low-rank matrices with noise and high-dimensional scaling

0 references

Exact matrix completion via convex optimization

0 references

Robust Spectral Compressed Sensing via Structured Matrix Completion

0 references

Exact and Stable Covariance Estimation From Quadratic Sampling via Convex Programming

0 references

Q4637073

0 references

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

0 references

Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements

0 references

Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview

0 references

Phase Retrieval Using Alternating Minimization

0 references

Solving Systems of Random Quadratic Equations via Truncated Amplitude Flow

0 references

A geometric analysis of phase retrieval

0 references

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

0 references

Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval

0 references

Matrix Completion From a Few Entries

0 references

Low-rank matrix completion using alternating minimization

0 references

Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably

0 references

Guarantees of Riemannian Optimization for Low Rank Matrix Recovery

0 references

Symmetry, Saddle Points, and Global Optimization Landscape of Nonconvex Matrix Factorization

0 references

Deterministic Guarantees for Burer‐Monteiro Factorizations of Smooth Semidefinite Programs

0 references

Nonconvex Phase Synchronization

0 references

Blind Recovery of Sparse Signals From Subsampled Convolution

0 references

The Projected Power Method: An Efficient Algorithm for Joint Alignment from Pairwise Differences

0 references

On <i>k</i>-Median clustering in high dimensions

0 references

Low-Rank Positive Semidefinite Matrix Recovery From Corrupted Rank-One Measurements

0 references

Phaselift is robust to a constant fraction of arbitrary errors

0 references

Compressive principal component pursuit

0 references

Identifiers

zbMATH Open document ID

1450.94011

0 references

DOI

10.1007/978-3-319-73074-5_8

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3296183