No label defined (Q4993268)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7359342

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

Statements

scholarly article

0 references

Maria-Florina Balcan

0 references

0 references

David P. Woodruff

0 references

0 references

publication date

15 June 2021

0 references

full work available at URL

https://arxiv.org/abs/1704.08683

0 references

zbMATH Keywords

nonconvex optimization

0 references

strong duality

0 references

matrix completion

0 references

robust PCA

0 references

sample complexity

0 references

describes a project that uses

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

Katyusha: the first direct acceleration of stochastic gradient methods

0 references

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

0 references

On the combinatorial and algebraic complexity of quantifier elimination

0 references

Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints

0 references

0 references

Robust principal component analysis?

0 references

Exact matrix completion via convex optimization

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

Relations between average case complexity and approximation complexity

0 references

Recovering Low-Rank Matrices From Few Coefficients in Any Basis

0 references

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

0 references

0 references

Introduction to the Theory of Nonlinear Optimization

0 references

Low-rank matrix completion using alternating minimization

0 references

Matrix Completion From a Few Entries

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

On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals

0 references

On the computational complexity and geometry of the first-order theory of the reals. II: The general decision problem. Preliminaries for quantifier elimination

0 references

Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality

0 references

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

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

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

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

0 references

Identifiers

zbMATH Open document ID

0 references

10.4230/LIPIcs.ITCS.2018.5

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4993268

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