activity
20212026
most citedStrong Optimal Classification Trees

15 citations · 20 across the 9 of their papers we have counts for

collaborators

10 papers

math.OC2026

Convexification of mixed-integer quadratic optimization via decision diagrams

Soobin Choi, Salar Fattahi, Andres Gomez +2

We study mixed-integer quadratic optimization (MIQO) problems with indicator variables. We propose a unified framework, based on decision diagrams, that serves both to solve the as…

math.OC2026

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…

math.OC2022

On the convex hull of convex quadratic optimization problems with indicators

Linchuan Wei, Alper Atamtürk, Andrés Gómez +1

We consider the convex quadratic optimization problem with indicator variables and arbitrary constraints on the indicators. We show that a convex hull description of the associated…

math.OC2021★ 4 cited

The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables

Shaoning Han, Andrés Gómez, Alper Atamtürk

In this paper, we compare the strength of the optimal perspective reformulation and Shor's SDP relaxation. We prove these two formulations are equivalent for quadratic optimization…

math.OC2021

A Graph-based Decomposition Method for Convex Quadratic Optimization with Indicators

Peijing Liu, Salar Fattahi, Andrés Gómez +1

In this paper, we consider convex quadratic optimization problems with indicator variables when the matrix defining the quadratic term in the objective is sparse. We use a grap…

math.OC2021

Compact extended formulations for low-rank functions with indicator variables

Shaoning Han, Andrés Gómez

We study the mixed-integer epigraph of a special class of convex functions with non-convex indicator constraints, which are often used to impose logical constraints on the support…

cs.LG2021

Learning Optimal Prescriptive Trees from Observational Data

Nathanael Jo, Sina Aghaei, Andrés Gómez +1

We consider the problem of learning an optimal prescriptive tree (i.e., an interpretable treatment assignment policy in the form of a binary tree) of moderate depth, from observati…

cs.CV2021★ 1 cited

Dynamic and Static Object Detection Considering Fusion Regions and Point-wise Features

Andrés Gómez, Thomas Genevois, Jerome Lussereau +1

Object detection is a critical problem for the safe interaction between autonomous vehicles and road users. Deep-learning methodologies allowed the development of object detection…

cond-mat.mes-hall2021

The Axial Anomaly in Lorentz Violating Theories: Towards the Electromagnetic Response of Weakly Tilted Weyl Semimetals

Andrés Gómez, Luis Urrutia

Using the path integral formulation in Euclidean space, we extended the calculation of the abelian chiral anomalies in the case of Lorentz violating theories by considering a new f…

cs.LG2021★ 15 cited

Strong Optimal Classification Trees

Sina Aghaei, Andrés Gómez, Phebe Vayanos

Decision trees are among the most popular machine learning models and are used routinely in applications ranging from revenue management and medicine to bioinformatics. In this pap…