Naive feature selection : a nearly tight convex relaxation for sparse naive Bayes
Year of publication: |
2024
|
---|---|
Authors: | Askari, Armin ; D'Aspremont, Alexandre ; El Ghaoui, Laurent |
Published in: |
Mathematics of operations research. - Hanover, Md. : INFORMS, ISSN 1526-5471, ZDB-ID 2004273-5. - Vol. 49.2024, 1, p. 278-296
|
Subject: | 62F07 | Fenchel duality | Lagrangian duality | nonconvex optimization | Shapley–Folkman theorem | sparsity | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
K-optimal design via semidefinite programming and entropy optimization
Maréchal, Pierre, (2015)
-
Adjustable robust optimization with objective uncertainty
Detienne, Boris, (2024)
-
Patriksson, Michael, (2015)
- More ...
-
Static Arbitrage Bounds on Basket Option Prices
d'Aspremont, Alexandre, (2004)
-
A Direct Formulation for Sparse Pca Using Semidefinite Programming
d'Aspremont, Alexandre, (2004)
-
Robust Dynamic Traffic Assignment under Demand and Capacity Uncertainty
Calafiore, Giuseppe, (2008)
- More ...