Complexity and applications of the homotopy principle for uniformly constrained sparse minimization
From MaRDI portal
Publication:2019907
Recommendations
- A primal-dual homotopy algorithm for \(\ell _{1}\)-minimization with \(\ell _{\infty }\)-constraints
- The homotopy method revisited: computing solution paths of \(\ell_1\)-regularized problems
- Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
- A proximal-gradient homotopy method for the sparse least-squares problem
- Weighted thresholding homotopy method for sparsity constrained optimization
Cites work
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A constrained \(\ell _{1}\) minimization approach to sparse precision matrix estimation
- A direct estimation approach to sparse linear discriminant analysis
- A mathematical introduction to compressive sensing
- A new approach to variable selection in least squares problems
- A primal-dual homotopy algorithm for \(\ell _{1}\)-minimization with \(\ell _{\infty }\)-constraints
- Atomic Decomposition by Basis Pursuit
- Compressed sensing
- DASSO: Connections Between the Dantzig Selector and Lasso
- Decoding by Linear Programming
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Least angle regression. (With discussion)
- On L1 and Chebyshev estimation
- Solving basis pursuit: heuristic optimality check and solver comparison
- Sparse Approximate Solutions to Linear Systems
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Über diskrete und lineare Tschebyscheff-Approximationen
Cited in
(2)
This page was built for publication: Complexity and applications of the homotopy principle for uniformly constrained sparse minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2019907)
