scientific article; zbMATH DE number 7255090
From MaRDI portal
Publication:4969108
zbMath1499.62199arXiv1812.11466MaRDI QIDQ4969108
Somayeh Sojoudi, Salar Fattahi
Publication date: 5 October 2020
Full work available at URL: https://arxiv.org/abs/1812.11466
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Analysis of Asymptotic Escape of Strict Saddle Sets in Manifold Optimization ⋮ Nonsmooth rank-one matrix factorization landscape
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- A geometric analysis of phase retrieval
- Principal manifolds for data visualization and dimension reduction. Reviews and original papers presented partially at the workshop `Principal manifolds for data cartography and dimension reduction', Leicester, UK, August 24--26, 2006.
- A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization
- A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization
- Non-Negative Principal Component Analysis: Message Passing Algorithms and Sharp Asymptotics
- Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture
- Robust principal component analysis?
- Rank-Sparsity Incoherence for Matrix Decomposition
- Decoding by Linear Programming
- Optimization of lipschitz continuous functions
- Composite Difference-Max Programs for Modern Statistical Estimation Problems
- Global Optimality in Low-Rank Matrix Optimization
- Optimization Methods for Large-Scale Machine Learning
- Nonconvex Robust Low-Rank Matrix Recovery
- Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
- Robust Matrix Decomposition With Sparse Corruptions
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- Learning the parts of objects by non-negative matrix factorization
- Breaking the Curse of Dimensionality with Convex Neural Networks
- Pricing Interest-Rate-Derivative Securities
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Stable signal recovery from incomplete and inaccurate measurements
This page was built for publication:
