Sparse and Smooth Signal Estimation: Convexification of L0-Formulations. - Alper Atamtürk; Andrés Gómez 001; Shaoning Han (J. Mach. Learn. Res., 2021)

Fractional 0-1 programming and submodularity. - Shaoning Han; Andrés Gómez 001; Oleg A. Prokopyev (J. Glob. Optim., 2022)

The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables. - Shaoning Han; Andrés Gómez 001; Alper Atamtürk (Oper. Res. Lett., 2022)

Some Strongly Polynomially Solvable Convex Quadratic Programs with Bounded Variables. - Jong-Shi Pang; Shaoning Han (SIAM J. Optim., 2023)

$ mathbf {2 times 2}$-Convexifications for convex quadratic optimization with indicator variables. - Shaoning Han; Andrés Gómez 001; Alper Atamtürk (Math. Program., 2023)

Robust support vector machines via conic optimization. - Valentina Cepeda; Andrés Gómez 001; Shaoning Han (CoRR, 2024)

On the number of pivots of Dantzig's simplex methods for linear and convex quadratic programs. - Shaoning Han; Xinyao Zhang; Jong-Shi Pang (Oper. Res. Lett., 2024)

Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix. - Ziyu He; Shaoning Han; Andrés Gómez 001; Ying Cui 004; Jong-Shi Pang (Math. Program., 2024)

Continuous Selections of Solutions to Parametric Variational Inequalities. - Shaoning Han; Jong-Shi Pang (SIAM J. Optim., 2024)