Beyond the Birkhoff Polytope: Convex Relaxations for Vector Permutation Problems. - Cong Han Lim; Stephen J. Wright 001 (NIPS, 2014)

Efficient Bregman Projections onto the Permutahedron and Related Polytopes. - Cong Han Lim; Stephen J. Wright 001 (AISTATS, 2016)

A Box-Constrained Approach for Hard Permutation Problems. - Cong Han Lim; Steve Wright (ICML, 2016)

Valid Inequalities for Separable Concave Constraints with Indicator Variables. - Cong Han Lim; Jeff T. Linderoth; James R. Luedtke (IPCO, 2016)

k-Support and Ordered Weighted Sparsity for Overlapping Groups: Hardness and Algorithms. - Cong Han Lim; Stephen J. Wright 001 (NIPS, 2017)

A Distributed Quasi-Newton Algorithm for Empirical Risk Minimization with Nonsmooth Regularization. - Ching-pei Lee; Cong Han Lim; Stephen J. Wright 001 (KDD, 2018)

An Efficient Pruning Algorithm for Robust Isotonic Regression. - Cong Han Lim (NeurIPS, 2018)

A Distributed Quasi-Newton Algorithm for Primal and Dual Regularized Empirical Risk Minimization. - Ching-pei Lee; Cong Han Lim; Stephen J. Wright 001 (CoRR, 2019)

Hierarchical Verification for Adversarial Robustness. - Cong Han Lim; Raquel Urtasun; Ersin Yumer (ICML, 2020)

Parallelizing Subgradient Methods for the Lagrangian Dual in Stochastic Mixed-Integer Programming. - Cong Han Lim; Jeffrey T. Linderoth; James R. Luedtke; Stephen J. Wright 001 (INFORMS J. Optim., 2021)