Safe feature elimination for non-negativity constrained convex optimization
From MaRDI portal
Publication:2302836
DOI10.1007/s10957-019-01612-wzbMath1432.90110arXiv1907.10831OpenAlexW2962945273WikidataQ126582201 ScholiaQ126582201MaRDI QIDQ2302836
James Folberth, Stephen R. Becker
Publication date: 26 February 2020
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.10831
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non-negative least squares for high-dimensional linear models: consistency and sparse recovery without regularization
- qpOASES: a parametric active-set algorithm for~quadratic programming
- Templates for convex cone problems with applications to sparse signal recovery
- Full spark frames
- The Lasso problem and uniqueness
- A hybrid quasi-Newton projected-gradient method with application to lasso and basis-pursuit denoising
- Necessary and sufficient conditions of solution uniqueness in 1-norm minimization
- Greed is Good: Algorithmic Results for Sparse Approximation
- Anatomy of high-performance matrix multiplication
- LAPACK Users' Guide
- First-Order Methods in Optimization
- Gap Safe screening rules for sparsity enforcing penalties
- Safe Feature Elimination in Sparse Supervised Learning
- Living on the edge: phase transitions in convex programs with random data
- The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems
- Convex analysis and monotone operator theory in Hilbert spaces
