Fast Optimization Methods for L1 Regularization: A Comparative Study and Two New Approaches
- 7 September 2007
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Feature selection, L1 vs. L2 regularization, and rotational invariancePublished by Association for Computing Machinery (ACM) ,2004
- A simple and efficient algorithm for gene selection using sparse logistic regressionBioinformatics, 2003
- Adaptive sparseness for supervised learningIeee Transactions On Pattern Analysis and Machine Intelligence, 2003
- SSVM: A Smooth Support Vector Machine for ClassificationComputational Optimization and Applications, 2001
- 10.1162/153244303322753698Applied Physics Letters, 2000
- 10.1162/153244303322753616Applied Physics Letters, 2000
- Numerical OptimizationPublished by Springer Science and Business Media LLC ,1999
- Penalized regressions: The bridge versus the lassoJournal of Computational and Graphical Statistics, 1998
- Two-Metric Projection Methods for Constrained OptimizationSIAM Journal on Control and Optimization, 1984
- Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problemsMathematical Programming, 1976