Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
- 1 January 2010
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 20 (6), 2807-2832
- https://doi.org/10.1137/090759574
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- An Algorithm and a Core Set Result for the Weighted Euclidean One-Center ProblemINFORMS Journal on Computing, 2009
- Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoidsOptimization Methods and Software, 2008
- For most large underdetermined systems of equations, the minimal 𝓁1‐norm near‐solution approximates the sparsest near‐solutionCommunications on Pure and Applied Mathematics, 2006
- Decoding by Linear ProgrammingIEEE Transactions on Information Theory, 2005
- Greedy function approximation: A gradient boosting machine.The Annals of Statistics, 2001
- Adaptive greedy approximationsConstructive Approximation, 1997
- Universal approximation bounds for superpositions of a sigmoidal functionIEEE Transactions on Information Theory, 1993
- A Simple Lemma on Greedy Approximation in Hilbert Space and Convergence Rates for Projection Pursuit Regression and Neural Network TrainingThe Annals of Statistics, 1992
- Some comments on Wolfe's ‘away step’Mathematical Programming, 1986
- An algorithm for quadratic programmingNaval Research Logistics Quarterly, 1956