Showing 1–20 of 31 results
/ Date/ Name
Aug 22, 2019Tractable Reformulations of Distributionally Robust Two-stage Stochastic Programs with $\infty-$Wasserstein DistanceJan 23, 2020Best Principal Submatrix Selection for the Maximum Entropy Sampling Problem: Scalable Algorithms and Performance GuaranteesDec 22, 2020Unbiased Subdata Selection for Fair Classification: A Unified Framework and Scalable AlgorithmsNov 2, 2024On the ReLU Lagrangian Cuts for Stochastic Mixed Integer ProgrammingDec 8, 2020ALSO-X and ALSO-X+: Better Convex Approximations for Chance Constrained ProgramsDec 30, 2023On Sparse Canonical Correlation AnalysisJun 11, 2018Scalable Algorithms for the Sparse Ridge RegressionFeb 23, 2018Approximation Algorithms for D-optimal DesignFeb 3, 2023ALSO-X#: Better Convex Approximations for Distributionally Robust Chance Constrained ProgramsAug 6, 2022D-optimal Data Fusion: Exact and Approximation AlgorithmsJan 31, 2024On Tractability, Complexity, and Mixed-Integer Convex Programming Representability of Distributionally Favorable OptimizationAug 28, 2020Exact and Approximation Algorithms for Sparse PCAJun 16, 2021Second-Order Conic and Polyhedral Approximations of the Exponential Cone: Application to Mixed-Integer Exponential Conic ProgramsOct 28, 2022On the Exactness of Dantzig-Wolfe Relaxation for Rank Constrained Optimization ProblemsNov 6, 2025Closing the Gap: Efficient Algorithms for Discrete Wasserstein BarycentersFeb 2, 2024Distributionally Fair Stochastic Optimization using Wasserstein DistanceMay 12, 2023On the Partial Convexification for Low-Rank Spectral Optimization: Rank Bounds and AlgorithmsJan 10, 2014Optimal Layout of Transshipment Facilities on An Infinite Homogeneous PlaneJun 19, 2018On Distributionally Robust Chance Constrained Programs with Wasserstein DistanceMay 7, 2021Beyond Symmetry: Best Submatrix Selection for the Sparse Truncated SVD