5 papers · 1 filter
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…
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…
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…
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…
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…