6 papers · 1 filter
Oracle-Based Distributionally Robust Optimization under Optimal Transport Ambiguity Sets
Guixian Chen, Salar Fattahi, Soroosh Shafiee
Distributionally robust optimization (DRO) with optimal transport ambiguity sets is traditionally solved by reformulating the minimax problem into a single-level convex program. Wh…
Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators
Tong Xu, Salar Fattahi, Andrés Gómez +1
We consider mixed-integer convex optimization problems in which binary indicators control continuous variables. We introduce the \emph{Coordinate Optimality Reformulation} (CORe) f…
Solving Convex Quadratic Optimization with Indicators Over Structured Graphs
Aaresh Bhathena, Salar Fattahi, Andrés Gómez +1
This paper studies convex quadratic minimization problems in which each continuous variable is coupled with a binary indicator variable. We focus on the structured setting where th…
Preconditioned Gradient Descent for Overparameterized Nonconvex Burer--Monteiro Factorization with Global Optimality Certification
Gavin Zhang, Salar Fattahi, Richard Y. Zhang
We consider using gradient descent to minimize the nonconvex function over an factor matrix , in which is an underlying smooth convex cost fun…
Preconditioned Gradient Descent for Over-Parameterized Nonconvex Matrix Factorization
Gavin Zhang, Salar Fattahi, Richard Y. Zhang
In practical instances of nonconvex matrix factorization, the rank of the true solution is often unknown, so the rank of the model can be overspecified as $r>r^{\st…
A Parametric Approach for Solving Convex Quadratic Optimization with Indicators Over Trees
Aaresh Bhathena, Salar Fattahi, Andrés Gómez +1
This paper investigates convex quadratic optimization problems involving indicator variables, each associated with a continuous variable, particularly focusing on scenarios whe…