137 citations · 650 across the 48 of their papers we have counts for
3 papers · 2 filters
Solving sparse principal component analysis with global support
Santanu S. Dey, Marco Molinaro, Guanyi Wang
Sparse principal component analysis with global support (SPCAgs), is the problem of finding the top- leading principal components such that all these principal components are li…
Branch-and-Bound Solves Random Binary IPs in Polytime
Santanu S. Dey, Yatharth Dubey, Marco Molinaro
Branch-and-bound is the workhorse of all state-of-the-art mixed integer linear programming (MILP) solvers. These implementations of branch-and-bound typically use variable branchin…
Sparse PSD approximation of the PSD cone
Grigoriy Blekherman, Santanu S. Dey, Marco Molinaro +1
While semidefinite programming (SDP) problems are polynomially solvable in theory, it is often difficult to solve large SDP instances in practice. One technique to address this iss…