11 citations · 21 across the 19 of their papers we have counts for
6 papers · 2 filters
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…
Computing D-Optimal solutions for huge-scale linear and quadratic response-surface models
Gabriel Ponte, Marcia Fampa, Jon Lee
We consider algorithmic approaches to the D-optimality problem for cases where the input design matrix is large and highly structured, in particular implicitly specified as a full…
Branch-and-bound for integer D-Optimality with fast local search and variable-bound tightening
Gabriel Ponte, Marcia Fampa, Jon Lee
We develop a branch-and-bound algorithm for the integer D-optimality problem, a central problem in statistical design theory, based on two convex relaxations, employing variable-bo…
Generalized Scaling for the Constrained Maximum-Entropy Sampling Problem
Zhongzhu Chen, Marcia Fampa, Jon Lee
The best practical techniques for exact solution of instances of the constrained maximum-entropy sampling problem, a discrete-optimization problem arising in the design of experime…
Branch-and-bound for D-Optimality with fast local search and variable-bound tightening
Gabriel Ponte, Marcia Fampa, Jon Lee
We apply a branch-and-bound (B\&B) algorithm to the D-optimality problem based on a convex mixed-integer nonlinear formulation. We discuss possible methodologies to accelerate the…
Generalized Scaling for the Constrained Maximum-Entropy Sampling Problem
Zhongzhu Chen, Marcia Fampa, Jon Lee
The best techniques for the constrained maximum-entropy sampling problem, a discrete-optimization problem arising in the design of experiments, are via a variety of concave continu…