Ryan Cory-Wright

Math. Program., November, 2023

A new perspective on low-rank optimization.

[BibT_eX]

[DOI]

Math. Program., November, 2023

AI Hilbert: From Data and Background Knowledge to Automated Scientific Discovery.

[BibT_eX]

[DOI]

CoRR, 2023

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

[BibT_eX]

[DOI]

Andrés Gómez

CoRR, 2023

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

[BibT_eX]

[DOI]

CoRR, 2023

2022

Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints.

[BibT_eX]

[DOI]

Oper. Res., November, 2022

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

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2022

A Scalable Algorithm for Sparse Portfolio Selection.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2022

Sparse PCA With Multiple Components.

[BibT_eX]

[DOI]

CoRR, 2022

2021

A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints.

[BibT_eX]

[DOI]

SIAM J. Optim., 2021

Sparse Plus Low Rank Matrix Decomposition: A Discrete Optimization Approach.

[BibT_eX]

[DOI]

Nicholas A. G. Johnson

CoRR, 2021

2020

On stochastic auctions in risk-averse electricity markets with uncertain supply.

[BibT_eX]

[DOI]

Golbon Zakeri

Oper. Res. Lett., 2020

On polyhedral and second-order cone decompositions of semidefinite optimization problems.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2020

2019

A unified approach to mixed-integer optimization: Nonlinear formulations and scalable algorithms.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Payment mechanisms for electricity markets with uncertain supply.

[BibT_eX]

[DOI]