activity
20172022
most citedSolving Linear Programs with Complementarity Constraints using Branch-and-Cut

4 citations · 11 across the 7 of their papers we have counts for

collaborators
Showing math.OCShow all

5 papers · 1 filter

math.OC2022★ 2 cited

Multi-Period Max Flow Network Interdiction with Restructuring for Disrupting Domestic Sex Trafficking Networks

Daniel Kosmas, Thomas C Sharkey, John E Mitchell +2

We consider a new class of multi-period network interdiction problems, where interdiction and restructuring decisions are decided upon before the network is operated and implemente…

math.OC2020★ 2 cited

Interdicting Restructuring Networks with Applications in Illicit Trafficking

Daniel Kosmas, Thomas C. Sharkey, John E. Mitchell +2

We consider a new class of max flow network interdiction problems, where the defender is able to introduce new arcs to the network after the attacker has made their interdiction de…

math.OC2020

Low-Rank Factorization for Rank Minimization with Nonconvex Regularizers

April Sagan, John E. Mitchell

Rank minimization is of interest in machine learning applications such as recommender systems and robust principal component analysis. Minimizing the convex relaxation to the rank…

math.OC2018★ 4 cited

Solving Linear Programs with Complementarity Constraints using Branch-and-Cut

Bin Yu, John E. Mitchell, Jong-Shi Pang

A linear program with linear complementarity constraints (LPCC) requires the minimization of a linear objective over a set of linear constraints together with additional linear com…

math.OC2017

A Penalty Method for Rank Minimization Problems in Symmetric Matrices

Xin Shen, John E. Mitchell

The problem of minimizing the rank of a symmetric positive semidefinite matrix subject to constraints can be cast equivalently as a semidefinite program with complementarity constr…