activity
20182025
most citedApproximate 1-norm minimization and minimum-rank structured sparsity for various generalized inverses via local search

3 citations · 6 across the 15 of their papers we have counts for

collaborators

16 papers

math.CO2025

The column number for 3-modular matrices

Joseph Paat, Zach Walsh, Luze Xu

An integer-valued matrix is -modular if each submatrix has determinant at most in absolute value. The c…

math.OC2025

Improved Mixing and Pressure Loss Formulations for Gas Network Optimization

Geonhee Kim, Christopher Lourenco, Daphne Skipper +1

Non-convex, nonlinear gas network optimization models are used to determine the feasibility of flows on existing networks given constraints on network flows, gas mixing, and pressu…

math.OC2024

ADMM for 0/1 D-optimality and Maximum-Entropy Sampling Relaxations

Gabriel Ponte, Marcia Fampa, Jon Lee +1

The 0/1 D-optimality problem and the Maximum-Entropy Sampling problem are two well-known NP-hard discrete maximization problems in experimental design. Algorithms for exact optimiz…

math.OC2024

Gaining or losing perspective for convex multivariate functions on box domains

Luze Xu, Jon Lee

MINLO (mixed-integer nonlinear optimization) formulations of the disjunction between the origin and a polytope via a binary indicator variable is broadly used in nonlinear combinat…

math.OC2024

Good and Fast Row-Sparse ah-Symmetric Reflexive Generalized Inverses

Gabriel Ponte, Marcia Fampa, Jon Lee +1

We present several algorithms aimed at constructing sparse and structured sparse (row-sparse) generalized inverses, with application to the efficient computation of least-squares s…

math.OC2023

Extended formulations for the integer hull of strictly -modular cographic polyhedral cones

Joseph Paat, Zach Walsh, Luze Xu

Conforti et al. give a compact extended formulation for a class of bimodular-constrained integer programs, namely those that model the stable set polytope of a graph with no disjoi…

math.OC2023

On computing sparse generalized inverses

Gabriel Ponte, Marcia Fampa, Jon Lee +1

The well-known M-P (Moore-Penrose) pseudoinverse is used in several linear-algebra applications; for example, to compute least-squares solutions of inconsistent systems of linear e…

math.OC2022

On the column number and forbidden submatrices for -modular matrices

Joseph Paat, Ingo Stallknecht, Zach Walsh +1

An integer matrix is -modular if the determinant of each submatrix of has absolute value at mo…

math.OC2022

Gaining or Losing Perspective for Convex Multivariate Functions on a Simplex

Luze Xu, Jon Lee

MINLO (mixed-integer nonlinear optimization) formulations of the disjunction between the origin and a polytope via a binary indicator variable have broad applicability in nonlinear…

math.OC2021★ 1 cited

Polynomial upper bounds on the number of differing columns of -modular integer programs

Jon Lee, Joseph Paat, Ingo Stallknecht +1

We study integer-valued matrices with bounded determinants. Such matrices appear in the theory of integer programs (IP) with bounded determinants. For example, Artmann et al. showe…

math.OC2020

1-norm minimization and minimum-rank structured sparsity for symmetric and ah-symmetric generalized inverses: rank one and two

Luze Xu, Marcia Fampa, Jon Lee

Generalized inverses are important in statistics and other areas of applied matrix algebra. A \emph{generalized inverse} of a real matrix is a matrix that satisfies the Moo…

math.OC2020

Gaining or Losing Perspective for Piecewise-Linear Under-Estimators of Convex Univariate Functions

Jon Lee, Daphne Skipper, Emily Speakman +1

We study MINLO (mixed-integer nonlinear optimization) formulations of the disjunction , where is a binary indicator of (),…

math.OC2020★ 1 cited

Improving proximity bounds using sparsity

Jon Lee, Joseph Paat, Ingo Stallknecht +1

We refer to the distance between optimal solutions of integer programs and their linear relaxations as proximity. In 2018, Eisenbrand and Weismantel proved that proximity is indepe…

math.OC2020★ 1 cited

Experimental analysis of local searches for sparse reflexive generalized inverses

Marcia Fampa, Jon Lee, Gabriel Ponte +1

The well-known M-P (Moore-Penrose) pseudoinverse is used in several linear-algebra applications; for example, to compute least-squares solutions of inconsistent systems of linear e…

math.OC2019★ 3 cited

Approximate 1-norm minimization and minimum-rank structured sparsity for various generalized inverses via local search

Luze Xu, Marcia Fampa, Jon Lee +1

Fundamental in matrix algebra and its applications, a \emph{generalized inverse} of a real matrix is a matrix that satisfies the Moore-Penrose (M-P) property . If $H…

math.OC2018

More Virtuous Smoothing

Luze Xu, Jon Lee, Daphne Skipper

In the context of global optimization of mixed-integer nonlinear optimization formulations, we consider smoothing univariate functions that satisfy , is increasing…