activity
20172023
most citedRank-one Convexification for Sparse Regression

21 citations · 67 across the 10 of their papers we have counts for

collaborators
Showing math.OCShow all

7 papers · 1 filter

math.OC2023

Solution Path of Time-varying Markov Random Fields with Discrete Regularization

Salar Fattahi, Andres Gomez

We study the problem of inferring sparse time-varying Markov random fields (MRFs) with different discrete and temporal regularizations on the parameters. Due to the intractability…

math.OC2022

A note on quadratic constraints with indicator variables: Convex hull description and perspective relaxation

Andres Gomez, Weijun Xie

In this paper, we study the mixed-integer nonlinear set given by a separable quadratic constraint on continuous variables, where each continuous variable is controlled by an additi…

math.OC2020★ 2 cited

Supermodularity and valid inequalities for quadratic optimization with indicators

Alper Atamturk, Andres Gomez

We study the minimization of a rank-one quadratic with indicators and show that the underlying set function obtained by projecting out the continuous variables is supermodular. Alt…

math.OC2020

Fractional 0-1 programming and submodularity

Shaoning Han, Andres Gomez, Oleg A Prokopyev

In this note we study multiple-ratio fractional 0--1 programs, a broad class of NP-hard combinatorial optimization problems. In particular, under some relatively mild assumptions w…

math.OC2020★ 6 cited

Ideal formulations for constrained convex optimization problems with indicator variables

Linchuan Wei, Andres Gomez, Simge Kucukyavuz

Motivated by modern regression applications, in this paper, we study the convexification of a class of convex optimization problems with indicator variables and combinatorial const…

math.OC2017

Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra

Alper Atamturk, Andres Gomez

We consider minimizing a conic quadratic objective over a polyhedron. Such problems arise in parametric value-at-risk minimization, portfolio optimization, and robust optimization…

math.OC2017

Submodularity in conic quadratic mixed 0-1 optimization

Alper Atamturk, Andres Gomez

We describe strong convex valid inequalities for conic quadratic mixed 0-1 optimization. These inequalities can be utilized for solving numerous practical nonlinear discrete optimi…