Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA
<jats:p> Dual Bounds of Sparse Principal Component Analysis </jats:p><jats:p> Sparse principal component analysis (PCA) is a widely used dimensionality reduction tool in machine learning and statistics. Compared with PCA, sparse PCA enhances the interpretability by incorporating a...
Main Authors: | Dey, Santanu S, Mazumder, Rahul, Wang, Guanyi |
---|---|
Other Authors: | Massachusetts Institute of Technology. Operations Research Center |
Format: | Article |
Language: | English |
Published: |
Institute for Operations Research and the Management Sciences (INFORMS)
2022
|
Online Access: | https://hdl.handle.net/1721.1/144219 |
Similar Items
-
Learning Sparse Classifiers: Continuous and Mixed Integer Optimization Perspectives
by: Dedieu, Antoine, et al.
Published: (2022) -
The Discrete Dantzig Selector: Estimating Sparse Linear Models via Mixed Integer Linear Optimization
by: Mazumder, Rahul, et al.
Published: (2019) -
Sparse PCA from sparse linear regression
by: Bresler, Guy, et al.
Published: (2022) -
Sparse PCA from sparse linear regression
by: Bresler, Guy, et al.
Published: (2021) -
Sparse regression at scale: branch-and-bound rooted in first-order optimization
by: Hazimeh, Hussein, et al.
Published: (2022)