• 6. AI Hilbert: A New Paradigm for Scientific Discovery by Unifying Data and Background Knowledge

    Submitted, with Bachir El Khadir, Cristina Cornelio, Sanjeeb Dash, and Lior Horesh

  • 5. Gain Confidence, Reduce Disappointment: A New Approach to Cross-Validation for Sparse Regression

    Submitted, with Andrés Gómez

  • 4. Optimal Low-Rank Matrix Completion: Semidefinite Relaxations and Eigenvector Disjunctions

    Submitted, with Dimitris Bertsimas, Sean Lo, and Jean Pauphilet
    Preprint Code

  • 3. Sparse PCA With Multiple Components

    Submitted, with Jean Pauphilet
    Preprint Code

  • 2. A Stochastic Benders Decomposition Scheme for Large-Scale Data-Driven Network Design

    Major Revision, INFORMS Journal on Computing , with Dimitris Bertsimas, Jean Pauphilet, and Periklis Petridis


  • 9. A New Perspective on Low-Rank Optimization

    Mathematical Programming, 1-46, 2023, with Dimitris Bertsimas and Jean Pauphilet
    Preprint DOI Code Video

  • 7. Solving Large-Scale Sparse PCA to Certifiable (Near) Optimality

    Journal of Machine Learning Research, 23(13):1-35, 2022, with Dimitris Bertsimas and Jean Pauphilet
    Preprint Url Code Slides

  • 6. A Scalable Algorithm for Sparse Portfolio Selection

    INFORMS Journal on Computing, 34(3): 1489-1511, 2022, with Dimitris Bertsimas
    Preprint DOI Code Poster

  • 3. On Stochastic Auctions in Risk-Averse Electricity Markets With Uncertain Supply

    Operations Research Letters, 48(3):376-384, 2020, with Golbon Zakeri
    Preprint DOI

  • 2. On Polyhedral and Second-Order Cone Decompositions of Semidefinite Optimization Problems

    Operations Research Letters, 48(1):78-85, 2020, with Dimitris Bertsimas
    Preprint DOI

  • Integer and Matrix Optimization: A Nonlinear Approach

    Ph.D. Thesis, Massachusetts Institute of Technology, May 2022
    MIT Libraries