383 citations · 1.2k across the 29 of their papers we have counts for
5 papers · 1 filter
CutQC: Using Small Quantum Computers for Large Quantum Circuit Evaluations
Wei Tang, Teague Tomesh, Martin Suchara +2
Quantum computing (QC) is a new paradigm offering the potential of exponential speedups over classical computing for certain computational problems. Each additional qubit doubles t…
Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions
Jeffrey Larson, Matt Menickelly, Baoyu Zhou
We propose a manifold sampling algorithm for minimizing a nonsmooth composition , where we assume is nonsmooth and may be inexpensively computed in closed form and…
Sequential Linearization Method for Bound-Constrained Mathematical Programs with Complementarity Constraints
Christian Kirches, Jeffrey Larson, Sven Leyffer +1
We propose an algorithm for solving bound-constrained mathematical programs with complementarity constraints on the variables. Each iteration of the algorithm involves solving a li…
Recursive Two-Step Lookahead Expected Payoff for Time-Dependent Bayesian Optimization
S. Ashwin Renganathan, Jeffrey Larson, Stefan Wild
We propose a novel Bayesian method to solve the maximization of a time-dependent expensive-to-evaluate oracle. We are interested in the decision that maximizes the oracle at a fini…
A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation
Fengqiao Luo, Jeffrey Larson
Platooning of vehicles is a promising approach for reducing fuel consumption, increasing vehicle safety, and using road space more efficiently. We consider the important but diffic…