Complexity and applications of the homotopy principle for uniformly constrained sparse minimization
DOI10.1007/s00245-019-09565-2zbMath1468.65070OpenAlexW2938146253WikidataQ128051230 ScholiaQ128051230MaRDI QIDQ2019907
Christoph Brauer, Dirk A. Lorenz
Publication date: 22 April 2021
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00245-019-09565-2
nonsmooth optimizationconvex optimizationcross-validationhomotopy methodsbinary classificationprimal-dual methods
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Numerical mathematical programming methods (65K05) Probabilistic models, generic numerical methods in probability and statistics (65C20) Convex programming (90C25) Linear programming (90C05)
Uses Software
Cites Work
- Unnamed Item
- A mathematical introduction to compressive sensing
- Über diskrete und lineare Tschebyscheff-Approximationen
- A primal-dual homotopy algorithm for \(\ell _{1}\)-minimization with \(\ell _{\infty }\)-constraints
- Least angle regression. (With discussion)
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- A Constrainedℓ1Minimization Approach to Sparse Precision Matrix Estimation
- On L1 and Chebyshev estimation
- A Direct Estimation Approach to Sparse Linear Discriminant Analysis
- Decoding by Linear Programming
- DASSO: Connections Between the Dantzig Selector and Lasso
- Atomic Decomposition by Basis Pursuit
- A new approach to variable selection in least squares problems
- Sparse Approximate Solutions to Linear Systems
- Solving Basis Pursuit
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Compressed sensing
This page was built for publication: Complexity and applications of the homotopy principle for uniformly constrained sparse minimization
