Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Q5214187 - MaRDI portal

No label defined (Q5214187)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7164702

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7164702

Statements

scholarly article

0 references

Maria-Florina Balcan

0 references

0 references

0 references

David P. Woodruff

0 references

0 references

publication date

7 February 2020

0 references

full work available at URL

http://jmlr.csail.mit.edu/papers/v20/17-611.html

0 references

zbMATH Keywords

strong duality

0 references

non-convex optimization

0 references

matrix factorization

0 references

matrix completion

0 references

robust principal component analysis

0 references

sample complexity

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

Noisy matrix decomposition via convex relaxation: optimal rates in high dimensions

0 references

Finding approximate local minima faster than gradient descent

0 references

Blind Deconvolution Using Convex Programming

0 references

Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut

0 references

Tensor decompositions for learning latent variable models

0 references

Computing a nonnegative matrix factorization -- provably

0 references

Sparse Modeling for Image and Vision Processing

0 references

0 references

Testing Matrix Rank, Optimally

0 references

Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints

0 references

Smoothed analysis of tensor decompositions

0 references

0 references

Exact matrix completion via convex optimization

0 references

Simple bounds for recovering low-complexity models

0 references

The Power of Convex Relaxation: Near-Optimal Matrix Completion

0 references

Robust principal component analysis?

0 references

Rank-Sparsity Incoherence for Matrix Decomposition

0 references

The convex geometry of linear inverse problems

0 references

Incoherence-Optimal Matrix Completion

0 references

Relations between average case complexity and approximation complexity

0 references

Algorithms and Computation

0 references

Recovering Low-Rank Matrices From Few Coefficients in Any Basis

0 references

Low-Rank Optimization With Convex Constraints

0 references

On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method

0 references

0 references

Low-rank matrix completion using alternating minimization

0 references

On Nonconvex Optimization for Machine Learning

0 references

Low-Rank Optimization on the Cone of Positive Semidefinite Matrices

0 references

Matrix Completion From a Few Entries

0 references

0 references

Low-rank models in visual analysis

0 references

An Almost Optimal Algorithm for Computing Nonnegative Rank

0 references

Restricted strong convexity and weighted matrix completion: Optimal bounds with noise

0 references

On the Sum of the Largest Eigenvalues of a Symmetric Matrix

0 references

Weighted low rank approximations with provable guarantees

0 references

A Simpler Approach to Matrix Completion

0 references

Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization

0 references

Low rank approximation with entrywise l <sub>1</sub> -norm error

0 references

Relative Error Tensor Low Rank Approximation

0 references

Learning Theory

0 references

Complete Dictionary Recovery Over the Sphere II: Recovery by Riemannian Trust-Region Method

0 references

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

0 references

Guaranteed Matrix Completion via Non-Convex Factorization

0 references

Compressed Sensing Off the Grid

0 references

Generalized Low Rank Models

0 references

Estimation in High Dimensions: A Geometric Perspective

0 references

Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm

0 references

Relations Among Some Low-Rank Subspace Recovery Models

0 references

Completing Low-Rank Matrices With Corrupted Samples From Few Coefficients in General Basis

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5214187

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