2 papers
cs.LG2022
Sparse PCA on fixed-rank matrices
Alberto Del Pia
Sparse PCA is the optimization problem obtained from PCA by adding a sparsity constraint on the principal components. Sparse PCA is NP-hard and hard to approximate even in the sing…
math.OC2019
Short simplex paths in lattice polytopes
Alberto Del Pia, Carla Michini
The goal of this paper is to design a simplex algorithm for linear programs on lattice polytopes that traces `short' simplex paths from any given vertex to an optimal one. We consi…