activity
20122024
most citedOutput Range Analysis for Deep Neural Networks

75 citations · 261 across the 31 of their papers we have counts for

collaborators
Showing math.OCShow all

13 papers · 1 filter

math.OC2022

A Framework for Fair Decision-making Over Time with Time-invariant Utilities

Andrea Lodi, Sriram Sankaranarayanan, Guanyi Wang

Fairness is a major concern in contemporary decision problems. In these situations, the objective is to maximize fairness while preserving the efficacy of the underlying decision-m…

math.OC2022★ 2 cited

Counterexample-guided computation of polyhedral Lyapunov functions for hybrid systems

Guillaume O. Berger, Sriram Sankaranarayanan

This paper presents a counterexample-guided iterative algorithm to compute convex, piecewise linear (polyhedral) Lyapunov functions for uncertain continuous-time linear hybrid syst…

math.OC2022

Learning fixed-complexity polyhedral Lyapunov functions from counterexamples

Guillaume O. Berger, Sriram Sankaranarayanan

We study the problem of synthesizing polyhedral Lyapunov functions for hybrid linear systems. Such functions are defined as convex piecewise linear functions, with a finite number…

math.OC2021★ 4 cited

An Abstract Model for Branch and Cut

Aleksandr M. Kazachkov, Pierre Le Bodic, Sriram Sankaranarayanan

Branch and cut is the dominant paradigm for solving a wide range of mathematical programming problems -- linear or nonlinear -- combining efficient search (via branch and bound) an…

math.OC2021

The Cut-and-Play Algorithm: Computing Nash Equilibria via Outer Approximations

Margarida Carvalho, Gabriele Dragotto, Andrea Lodi +1

We introduce Cut-and-Play, a practically-efficient algorithm for computing Nash equilibria in simultaneous non-cooperative games where players decide via nonconvex and possibly unb…

math.OC2021★ 21 cited

Fairness over time in dynamic resource allocation with an application in Healthcare

Andrea Lodi, Philippe Olivier, Gilles Pesant +1

Decision making problems are typically concerned with maximizing efficiency. In contrast, we address problems where there are multiple stakeholders and a centralized decision maker…

math.OC2020

Training Neural Network Controllers Using Control Barrier Functions in the Presence of Disturbances

Shakiba Yaghoubi, Georgios Fainekos, Sriram Sankaranarayanan

Control Barrier Functions (CBF) have been recently utilized in the design of provably safe feedback control laws for nonlinear systems. These feedback control methods typically com…

math.OC2019★ 1 cited

A learning-based algorithm to quickly compute good primal solutions for Stochastic Integer Programs

Yoshua Bengio, Emma Frejinger, Andrea Lodi +2

We propose a novel approach using supervised learning to obtain near-optimal primal solutions for two-stage stochastic integer programming (2SIP) problems with constraints in the f…

math.OC2018

Mixed-integer bilevel representability

Amitabh Basu, Christopher Thomas Ryan, Sriram Sankaranarayanan

We study the representability of sets that admit extended formulations using mixed-integer bilevel programs. We show that feasible regions modeled by continuous bilevel constraints…

math.OC2018

Can cut generating functions be good and efficient?

Amitabh Basu, Sriram Sankaranarayanan

Making cut generating functions (CGFs) computationally viable is a central question in modern integer programming research. One would like to find CGFs that are simultaneously good…

math.OC2016★ 16 cited

Sensitivity and Covariance in Stochastic Complementarity Problems with an Application to Natural Gas Markets

Sriram Sankaranarayanan, Felipe Feijoo, Sauleh Siddiqui

We provide an efficient method to approximate the covariance between decision variables and uncertain parameters in solutions to a general class of stochastic nonlinear complementa…

math.OC2015

Bernstein Polynomial Relaxations for Polynomial Optimization Problems

Mohamed Amin Ben Sassi, Sriram Sankaranarayanan

In this paper, we examine linear programming (LP) relaxations based on Bernstein polynomials for polynomial optimization problems (POPs). We present a progression of increasingly m…

math.OC2015★ 4 cited

Stabilization of polynomial dynamical systems using linear programming based on Bernstein polynomials

Mohamed Amin Ben Sassi, Sriram Sankaranarayanan

In this paper, we deal with the problem of synthesizing static output feedback controllers for stabilizing polynomial systems. Our approach jointly synthesizes a Lyapunov function…