scientific article; zbMATH DE number 7306888
From MaRDI portal
Publication:5148989
Javad Lavaei, Ramtin Madani, Igor Molybog
Publication date: 5 February 2021
Full work available at URL: https://jmlr.csail.mit.edu/papers/v21/18-881.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An elementary proof of convex phase retrieval in the natural parameter space via the linear program PhaseMax
- Robust matrix completion
- Second-order cone programming
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence
- Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
- Exact Recoverability From Dense Corrupted Observations via $\ell _{1}$-Minimization
- Robust principal component analysis?
- Decoding by Linear Programming
- A Low-Complexity Parallelizable Numerical Algorithm for Sparse Semidefinite Programming
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
- Convexification of Power Flow Equations in the Presence of Noisy Measurements
- Exactness of Semidefinite Relaxations for Nonlinear Optimization Problems with Underlying Graph Structure
- Recovery of Sparsely Corrupted Signals
- Dense Error Correction Via $\ell^1$-Minimization
- Robust Regression and Lasso
- Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization
This page was built for publication:
