research
∙
09/15/2023
The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization
With the goal of obtaining strong relaxations for binary polynomial opti...
share
research
∙
11/29/2022
An Approximation Algorithm for Indefinite Mixed Integer Quadratic Programming
In this paper, we give an algorithm that finds an epsilon-approximate so...
research
∙
06/09/2022
Clustering with Queries under Semi-Random Noise
The seminal paper by Mazumdar and Saha <cit.> introduced an extensive li...
research
∙
03/04/2022
An SDP Relaxation for the Sparse Integer Least Square Problem
In this paper, we study the sparse integer least square problem (SILS), ...
research
∙
02/14/2022
Rank-one Boolean tensor factorization and the multilinear polytope
We consider the NP-hard problem of approximating a tensor with binary en...
research
∙
01/07/2022
Sparse PCA on fixed-rank matrices
Sparse PCA is the optimization problem obtained from PCA by adding a spa...
research
∙
11/08/2021
Simple odd β-cycle inequalities for binary polynomial optimization
We consider the multilinear polytope which arises naturally in binary po...
research
∙
07/11/2020
On the complexity of binary polynomial optimization over acyclic hypergraphs
In this work we consider binary polynomial optimization, which is the pr...
research
∙
06/05/2020
Linear Programming and Community Detection
The problem of community detection with two equal-sized communities is c...
research
∙
12/12/2019
Short simplex paths in lattice polytopes
We consider the problem of optimizing a linear function over a lattice p...
research
∙
10/05/2018
Subdeterminants and Concave Integer Quadratic Programming
We consider the NP-hard problem of minimizing a separable concave quadra...
research
∙
10/05/2018
