scientific article; zbMATH DE number 7306888
From MaRDI portal
Publication:5148989
Recommendations
- Using conical regularization in calculating Lagrangian estimates in quadratic optimization problems
- Sparse Convex Regression
- Conic approximation to quadratic optimization with linear complementarity constraints
- An inexact projected gradient method for sparsity-constrained quadratic measurements regression
- Sparse Solutions by a Quadratically Constrained ℓq (0 <q< 1) Minimization Model
- Quadratic optimization over a polyhedral cone
- Publication:3481508
- Inexact successive quadratic approximation for regularized optimization
- Sparsity in convex quadratic programming with interior point methods
- Sparse Optimization with Least-Squares Constraints
Cites work
- A Low-Complexity Parallelizable Numerical Algorithm for Sparse Semidefinite Programming
- An elementary proof of convex phase retrieval in the natural parameter space via the linear program PhaseMax
- Convexification of Power Flow Equations in the Presence of Noisy Measurements
- Decoding by Linear Programming
- Dense Error Correction Via \ell^1-Minimization
- Exact Recoverability From Dense Corrupted Observations via $\ell _{1}$-Minimization
- Exactness of semidefinite relaxations for nonlinear optimization problems with underlying graph structure
- Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- Finding low-rank solutions of sparse linear matrix inequalities using convex optimization
- High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 1095138 (Why is no real title available?)
- scientific article; zbMATH DE number 194744 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- Recovery of Sparsely Corrupted Signals
- Robust matrix completion
- Robust principal component analysis?
- Robust Regression and Lasso
- Second-order cone programming
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
- The least trimmed squares. I: Consistency.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5148989)
