Exact and approximation algorithms for sparse principal component analysis
| Year of publication: |
2025
|
|---|---|
| Authors: | Li, Yongchun ; Xie, Weijun |
| Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 37.2025, 3, p. 582-602
|
| Subject: | mixed-integer programming | semidefinite programming | greedy | local search | sparse PCA | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Algorithmus | Algorithm | Hauptkomponentenanalyse | Principal component analysis | Ganzzahlige Optimierung | Integer programming |
-
rs-Sparse principal component analysis : a mixed integer nonlinear programming approach with VNS
Carrizosa, Emilio, (2014)
-
A branch-and-bound algorithm for the quadratic multiple knapsack problem
Fleszar, Krzysztof, (2022)
-
Exact and heuristic algorithms for the maximum weighted submatrix coverage problem
Sinnl, Markus, (2022)
- More ...
-
D-optimal Data Fusion : exact and approximation algorithms
Li, Yongchun, (2024)
-
Li, Yongchun, (2024)
-
Xie, Weijun, (2020)
- More ...