DASH: A Dimensionality Reduction Method for Large-scale Convex MIQP with Applications in Subset Portfolio Selection

Pinzhang Cheng

Subset selection problems as MIPs (Mixed Integer Programs) are NP-hard. For large scale problems, it is infeasible to find global optimal solutions in a reasonable time and good-qu…