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 2021Show all

2 papers · 1 filter

stat.ML2021

Provable Low Rank Plus Sparse Matrix Separation Via Nonconvex Regularizers

April Sagan, John E. Mitchell

This paper considers a large class of problems where we seek to recover a low rank matrix and/or sparse vector from some set of measurements. While methods based on convex relaxati…

cs.SI2021★ 2 cited

Optimizing Edge Sets in Networks to Produce Ground Truth Communities Based on Modularity

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

We consider two new problems regarding the impact of edge addition or removal on the modularity of partitions (or community structures) in a network. The first problem seeks to add…