Jeffrey Larson

Orcid: 0000-0001-9924-2082

Affiliations:
  • Argonne National Laboratory, Mathematics and Computer Science Division, Lemont, IL, USA


According to our database1, Jeffrey Larson authored at least 42 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
An Empirical Quantile Estimation Approach for Chance-Constrained Nonlinear Optimization Problems.
J. Optim. Theory Appl., October, 2024

Correction: Multistart algorithm for identifying all optima of nonconvex stochastic functions.
Optim. Lett., September, 2024

Multistart algorithm for identifying all optima of nonconvex stochastic functions.
Optim. Lett., July, 2024

Structure-aware methods for expensive derivative-free nonsmooth composite optimization.
Math. Program. Comput., 2024

Electric vehicle supply equipment location and capacity allocation for fixed-route networks.
Eur. J. Oper. Res., 2024

End-to-End Protocol for High-Quality QAOA Parameters with Few Shots.
CoRR, 2024

Portable, heterogeneous ensemble workflows at scale using libEnsemble.
CoRR, 2024

Integrating ytopt and libEnsemble to Autotune OpenMC.
CoRR, 2024

2023
Modeling approaches for addressing unrelaxable bound constraints with unconstrained optimization methods.
Optim. Lett., April, 2023

Binary Control Pulse Optimization for Quantum Systems.
Quantum, January, 2023

Comparison of multiobjective optimization methods for the LCLS-II photoinjector.
Comput. Phys. Commun., 2023

Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem.
CoRR, 2023

QContext: Context-Aware Decomposition for Quantum Gates.
Proceedings of the IEEE International Symposium on Circuits and Systems, 2023

2022
libEnsemble: A Library to Coordinate the Concurrent Evaluation of Dynamic Ensembles of Calculations.
IEEE Trans. Parallel Distributed Syst., 2022

Algorithm 1028: VTMOP: Solver for Blackbox Multiobjective Optimization Problems.
ACM Trans. Math. Softw., 2022

Sequential Linearization Method for Bound-Constrained Mathematical Programs with Complementarity Constraints.
SIAM J. Optim., 2022

A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation.
Oper. Res., 2022

Exploiting In-Constraint Energy in Constrained Variational Quantum Optimization.
CoRR, 2022


Characterizing Error Mitigation by Symmetry Verification in QAOA.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2022

Multiangle QAOA Does Not Always Need All Its Angles.
Proceedings of the 7th IEEE/ACM Symposium on Edge Computing, 2022

2021
Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions.
SIAM J. Optim., 2021

A method for convex black-box integer global optimization.
J. Glob. Optim., 2021

LEAP: Scaling Numerical Optimization Based Synthesis Using an Incremental Approach.
CoRR, 2021

Emerging Frameworks for Advancing Scientific Workflows Research, Development, and Education.
Proceedings of the 2021 IEEE Workshop on Workflows in Support of Large-Scale Science (WORKS), 2021

CutQC: using small Quantum computers for large Quantum circuit evaluations.
Proceedings of the ASPLOS '21: 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, 2021

2020
Multiobjective Optimization of the Variability of the High-Performance Linpack Solver.
Proceedings of the Winter Simulation Conference, 2020

Managing Computationally Expensive Blackbox Multiobjective Optimization Problems Wwth Libensemble.
Proceedings of the Spring Simulation Conference, 2020

2019
Derivative-free optimization methods.
Acta Numer., 2019

Multistart Methods for Quantum Approximate optimization.
Proceedings of the 2019 IEEE High Performance Extreme Computing Conference, 2019

2018
Manifold Sampling for Optimization of Nonconvex Functions That Are Piecewise Linear Compositions of Smooth Components.
SIAM J. Optim., 2018

Asynchronously parallel optimization solver for finding multiple minima.
Math. Program. Comput., 2018

2017
Scheduling double round-robin tournaments with divisional play using constraint programming.
Eur. J. Oper. Res., 2017

Platoon formation maximization through centralized routing and departure time coordination.
CoRR, 2017

2016
Manifold Sampling for ℓ<sub>1</sub> Nonconvex Optimization.
SIAM J. Optim., 2016

Stochastic derivative-free optimization using a trust region framework.
Comput. Optim. Appl., 2016

Coordinated Platoon Routing in a Metropolitan Network.
Proceedings of the 2016 Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific Computing, 2016

2015
A Distributed Framework for Coordinated Heavy-Duty Vehicle Platooning.
IEEE Trans. Intell. Transp. Syst., 2015

2014
An Integrated Constraint Programming Approach to Scheduling Sports Leagues with Divisional and Round-Robin Tournaments.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2014

2013
Derivative-Free Optimization of Expensive Functions with Computational Error Using Weighted Regression.
SIAM J. Optim., 2013

Non-intrusive termination of noisy optimization.
Optim. Methods Softw., 2013

Coordinated route optimization for heavy-duty vehicle platoons.
Proceedings of the 16th International IEEE Conference on Intelligent Transportation Systems, 2013


  Loading...