default search action
Jeffrey Larson 0001
Person information
- affiliation: Argonne National Laboratory, Mathematics and Computer Science Division, Lemont, IL, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j23]Amir Davatgari
, Taner Cokyasar
Electric vehicle supply equipment location and capacity allocation for fixed-route networks. Eur. J. Oper. Res. 317(3): 953-966 (2024) - [j22]Fengqiao Luo
An Empirical Quantile Estimation Approach for Chance-Constrained Nonlinear Optimization Problems. J. Optim. Theory Appl. 203(1): 767-809 (2024) - [j21]Jeffrey Larson
Structure-aware methods for expensive derivative-free nonsmooth composite optimization. Math. Program. Comput. 16(1): 1-36 (2024) - [j20]Prateek Jaiswal
Multistart algorithm for identifying all optima of nonconvex stochastic functions. Optim. Lett. 18(6): 1335-1360 (2024) - [j19]Prateek Jaiswal
Correction: Multistart algorithm for identifying all optima of nonconvex stochastic functions. Optim. Lett. 18(7): 1755 (2024) - [i10]Xingfu Wu
Integrating ytopt and libEnsemble to Autotune OpenMC. CoRR abs/2402.09222 (2024) - [i9]Stephen Hudson, Jeffrey Larson, John-Luke Navarro, Stefan M. Wild
Portable, heterogeneous ensemble workflows at scale using libEnsemble. CoRR abs/2403.03709 (2024) - [i8]Tianyi Hao, Zichang He, Ruslan Shaydulin, Jeffrey Larson, Marco Pistoia:
End-to-End Protocol for High-Quality QAOA Parameters with Few Shots. CoRR abs/2408.00557 (2024) - 2023
- [j18]Nicole Neveu
Comparison of multiobjective optimization methods for the LCLS-II photoinjector. Comput. Phys. Commun. 283: 108566 (2023) - [j17]Jeffrey Larson
Modeling approaches for addressing unrelaxable bound constraints with unconstrained optimization methods. Optim. Lett. 17(3): 561-589 (2023) - [j16]Xinyu Fei
Binary Control Pulse Optimization for Quantum Systems. Quantum 7: 892 (2023) - [c12]Ji Liu
QContext: Context-Aware Decomposition for Quantum Gates. ISCAS 2023: 1-5 - [i7]Ji Liu, Max Bowman, Pranav Gokhale, Siddharth Dangwal, Jeffrey Larson, Frederic T. Chong, Paul D. Hovland:
QContext: Context-Aware Decomposition for Quantum Gates. CoRR abs/2302.02003 (2023) - [i6]Ruslan Shaydulin, Changhao Li, Shouvanik Chakrabarti, Matthew DeCross
Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem. CoRR abs/2308.02342 (2023) - 2022
- [j15]Fengqiao Luo
A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation. Oper. Res. 70(4): 2477-2495 (2022) - [j14]Christian Kirches
Sequential Linearization Method for Bound-Constrained Mathematical Programs with Complementarity Constraints. SIAM J. Optim. 32(1): 75-99 (2022) - [j13]Tyler H. Chang
Algorithm 1028: VTMOP: Solver for Blackbox Multiobjective Optimization Problems. ACM Trans. Math. Softw. 48(3): 36:1-36:34 (2022) - [j12]Stephen Hudson
libEnsemble: A Library to Coordinate the Concurrent Evaluation of Dynamic Ensembles of Calculations. IEEE Trans. Parallel Distributed Syst. 33(4): 977-988 (2022) - [c11]Kaiyan Shi
Multiangle QAOA Does Not Always Need All Its Angles. SEC 2022: 414-419 - [c10]Ashish Kakkar, Jeffrey Larson
Characterizing Error Mitigation by Symmetry Verification in QAOA. QCE 2022: 635-645 - [c9]Ishan Abhinit, Emily K. Adams, Khairul Alam, Brian Chase, Ewa Deelman, Lev Gorenstein, Stephen Hudson
Novel Proposals for FAIR, Automated, Recommendable, and Robust Workflows. WORKS@SC 2022: 84-92 - [i5]Tianyi Hao, Ruslan Shaydulin, Marco Pistoia, Jeffrey Larson:
Exploiting In-Constraint Energy in Constrained Variational Quantum Optimization. CoRR abs/2211.07016 (2022) - 2021
- [j11]Jeffrey Larson
A method for convex black-box integer global optimization. J. Glob. Optim. 80(2): 439-477 (2021) - [j10]Jeffrey Larson
Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions. SIAM J. Optim. 31(4): 2638-2664 (2021) - [c8]Wei Tang
CutQC: using small Quantum computers for large Quantum circuit evaluations. ASPLOS 2021: 473-486 - [c7]Henri Casanova, Ewa Deelman, Sandra Gesing, Michael D. Hildreth, Stephen Hudson
Emerging Frameworks for Advancing Scientific Workflows Research, Development, and Education. WORKS 2021: 74-80 - [i4]Stephen Hudson, Jeffrey Larson, John-Luke Navarro, Stefan M. Wild:
libEnsemble: A Library to Coordinate the Concurrent Evaluation of Dynamic Ensembles of Calculations. CoRR abs/2104.08322 (2021) - [i3]Ethan Smith, Marc Grau Davis, Jeffrey M. Larson, Ed Younis, Costin Iancu, Wim Lavrijsen:
LEAP: Scaling Numerical Optimization Based Synthesis Using an Incremental Approach. CoRR abs/2106.11246 (2021) - 2020
- [c6]Tyler H. Chang
Managing Computationally Expensive Blackbox Multiobjective Optimization Problems Wwth Libensemble. SpringSim 2020: 1-12 - [c5]Tyler H. Chang
Multiobjective Optimization of the Variability of the High-Performance Linpack Solver. WSC 2020: 3081-3092 - [i2]Wei Tang, Teague Tomesh, Jeffrey Larson, Martin Suchara, Margaret Martonosi:
CutQC: Using Small Quantum Computers for Large Quantum Circuit Evaluations. CoRR abs/2012.02333 (2020)
2010 – 2019
- 2019
- [j9]Jeffrey Larson
Derivative-free optimization methods. Acta Numer. 28: 287-404 (2019) - [c4]Ruslan Shaydulin
Multistart Methods for Quantum Approximate optimization. HPEC 2019: 1-8 - 2018
- [j8]Jeffrey Larson
Asynchronously parallel optimization solver for finding multiple minima. Math. Program. Comput. 10(3): 303-332 (2018) - [j7]Kamil A. Khan, Jeffrey Larson
Manifold Sampling for Optimization of Nonconvex Functions That Are Piecewise Linear Compositions of Smooth Components. SIAM J. Optim. 28(4): 3001-3024 (2018) - 2017
- [j6]Mats Carlsson, Mikael Johansson, Jeffrey Larson
Scheduling double round-robin tournaments with divisional play using constraint programming. Eur. J. Oper. Res. 259(3): 1180-1190 (2017) - [i1]Vadim Sokolov, Jeffrey Larson, Todd S. Munson, Joshua Auld, Dominik Karbowski:
Platoon formation maximization through centralized routing and departure time coordination. CoRR abs/1701.01391 (2017) - 2016
- [j5]Jeffrey Larson
Stochastic derivative-free optimization using a trust region framework. Comput. Optim. Appl. 64(3): 619-645 (2016) - [j4]Jeffrey Larson
Manifold Sampling for ℓ1 Nonconvex Optimization. SIAM J. Optim. 26(4): 2540-2563 (2016) - [c3]Jeffrey Larson
Coordinated Platoon Routing in a Metropolitan Network. CSC 2016: 73-82 - 2015
- [j3]Jeffrey Larson
A Distributed Framework for Coordinated Heavy-Duty Vehicle Platooning. IEEE Trans. Intell. Transp. Syst. 16(1): 419-429 (2015) - 2014
- [c2]Jeffrey Larson
An Integrated Constraint Programming Approach to Scheduling Sports Leagues with Divisional and Round-Robin Tournaments. CPAIOR 2014: 144-158 - 2013
- [j2]Jeffrey Larson
Non-intrusive termination of noisy optimization. Optim. Methods Softw. 28(5): 993-1011 (2013) - [j1]Stephen C. Billups
Derivative-Free Optimization of Expensive Functions with Computational Error Using Weighted Regression. SIAM J. Optim. 23(1): 27-53 (2013) - [c1]Jeffrey Larson
Coordinated route optimization for heavy-duty vehicle platoons. ITSC 2013: 1196-1202
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-04 21:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: