Low-Rank KKT Updates and a Parallel Flipping Mechanism for Model-Based Derivative-Free Optimization

Donghan Wu; Pengcheng Xie

REVIEW 3 major objections 3 minor 299 references

Low-Rank KKT Updates and a Parallel Flipping Mechanism for Model-Based Derivative-Free Optimization

T0 review · 3 major / 3 minor · reviewed 2026-08-02 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read This paper claims that in the least Frobenius norm updating model, flipping a coordinate axis of every interpolation point changes the KKT matrix by exactly a rank-2 perturbation, enabling O(n^2) model updates instead of O(m^3) refactorizat

desk verdict The central inverse update is wrong; the O(n^2) claim collapses, though the axis-flip invariance is a valid new observation. read the letter →

arxiv 2607.22538 v1 pith:RNZWP7UQ submitted 2026-04-21 math.OC

Donghan Wu , Pengcheng Xie This is my paper · ORCID

classification math.OC MSC 90C5690C3065K05

keywords derivative-freeoptimizationquadraticinterpolationmodelsleastFrobeniusnormupdatingKKTmatrixupdaterank-2coordinateflippingtrust-regionmethodsparallel

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper claims that in the least Frobenius norm updating model for derivative-free optimization, both a single-point replacement and a coordinated flip of every interpolation point's t-th coordinate produce exactly a rank-2 perturbation to the KKT matrix of the interpolation conditions. Because the geometry block depends only on inner products, the flip x_i -> x_i - 2 x_i^{(t)} e_t leaves the quadratic geometry unchanged while altering only one row and column of the coordinate block. This allows the inverse KKT matrix to be refreshed in O(n^2) via a standard rank-two inverse update identity, rather than O(m^3). The authors embed this update in a parallel trust-region algorithm where each worker flips a random axis, locally updates the model, and the best configuration is synchronized. If correct, the payoff is cheaper model maintenance and better performance under tight function-evaluation budgets, demonstrated on 530 benchmark problems.

What carries the argument

The central object is the KKT matrix W = [[A, X^T],[X,0]] whose entries are purely inner products of the interpolation points, with A_ij = 1/2 (x_i^T x_j)^2. The load-bearing mechanism is the observation that negating the t-th coordinate of every interpolation point leaves A unchanged and alters only one row/column of the coordinate block, so the entire perturbation to W is a symmetric rank-2 matrix e_k w^T + w e_k^T. This reduces model maintenance to an O(n^2) rank-two inverse refresh instead of an O(m^3) refactorization; Algorithm 1 uses this to let parallel workers flip axes, update models locally, and synchronize the best configuration.

What would settle it

For a small random instance (n=3, m=7), compute H_new both by direct inversion of W + e_k w^T + w e_k^T and by Eq. (6); any numerical mismatch invalidates the update formula. Separately, run the algorithm on f(x) = x_1 and inspect whether Step 6 uses fresh objective values at flipped points; if not, the local model will not match the points actually evaluated.

Watch

Extended reading notes

Core claim

The central claim is that interpolation-set updates in the least Frobenius norm setting carry exploitable algebraic structure. With A_ij = 1/2 (x_i^T x_j)^2 and X the interpolation-point coordinate block, the KKT matrix W = [[A, X^T],[X,0]] changes only in one row and column when a single point is replaced, and the same holds when every point's t-th coordinate is negated via x_i -> x_i - 2 x_i^{(t)} e_t. The paper proves that this cross-shaped perturbation decomposes as e_k w^T + w e_k^T, a rank-2 update, so a standard rank-two inverse update identity yields an explicit O(n^2) formula for the new inverse H. The authors argue this eliminates the O(m^3) refactorizations ordinarily needed after

Load-bearing premise

The flipped interpolation set is used for model building and incumbent selection without an explicit statement of where f at the flipped points comes from; the update is only well-defined if f(flip(x)) is known or assumed equal to f(x).

Editorial extensions

If this is right

Model maintenance in the least Frobenius norm updating framework drops from O(m^3) to O(n^2) per interpolation-set modification, making frequent updates affordable in higher dimensions.
Coordinate-axis flips become a cheap parallel exploration mechanism: each worker independently flips an axis, updates its local KKT inverse, and searches without re-factorizing.
The rank-2 structure is exact, so the update formula introduces no approximation beyond floating-point arithmetic.
On the 530-instance benchmark suite, the approach reports higher success rates than the standard solvers tested, especially at loose accuracy tolerances and tight budgets.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

Editorial inference: the paper never states where the objective values at flipped points come from when the KKT residuals are formed in Step 6; if they are not freshly evaluated, the algorithm silently assumes f is invariant under coordinate-sign flips.
Editorial inference: on functions that are not symmetric under sign flips, the flipped interpolation set would require fresh evaluations before model building, changing the cost accounting and possibly erasing the reported budget advantage.
Editorial inference: the same rank-2 mechanism might extend to block-wise coordinate transformations that flip several axes at once, provided the induced perturbation to A remains zero; the paper treats only single-axis flips.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Colleague — the short version: Eq. (6), the paper's load-bearing inverse update, is wrong. Take W=I_2, e=e_1, w=2e_1. The true updated inverse is diag(1/5,1), while their formula returns diag(1/2,1). The Sherman-Morrison-Woodbury identity they invoke gives a different expression; this is not a typo. Since Algorithm 1's Rank2Up and the O(n^2) maintenance claim both call this formula, the central method collapses.

What is genuinely new and correct: Theorem 1's axis-flip observation. If you flip the t-th coordinate of every interpolation point, the A block of the least-Frobenius KKT matrix is unchanged and ΔW is exactly rank-2. That is a clean, verifiable fact and I don't think it appears in the cited NEWUOA literature. The single-point replacement rank-2 structure, by contrast, is already known in NEWUOA-style implementations, so the true novelty is the flip, not the low-rank update.

Soft spots, in order of severity. First, Eq (6) fails on the paper's own setup, and the stress-test counterexample is conclusive. Second, Algorithm 1 flips all coordinates in Step 4 and then solves the KKT system in Step 6; that requires f at the flipped points. No such evaluations are described, and no symmetry assumption is stated. If f is not even in the flipped coordinate, the model update and the argmin in Step 9 are undefined. Third, the numerical section gives no code, no baseline versions, and only text descriptions of data profiles; even if the algebra were right, I couldn't reproduce the claimed gains.

I want to give credit where it's due: the paper is clearly written, the geometric insight is real, and the benchmark design is standard. But the central algebraic result is false, and the parallel algorithm has an unflagged data-flow hole. I would not send this to peer review. A serious referee would find the same counterexample in ten minutes. The right move is to tell the authors to fix Eq (6), state explicitly where flipped-point function values come from, and only then consider a resubmission.

Referee Report

3 major / 3 minor

Summary. The paper proposes a parallel trust-region derivative-free optimization method built on least Frobenius norm quadratic interpolation. It claims that if all interpolation points have one coordinate flipped, the KKT matrix W is perturbed by the rank-2 term ΔW = e_k w^T + w e_k^T, and that Eq. (6), derived from Sherman-Morrison-Woodbury, updates H = W^{-1} in O(n^2). Algorithm 1 uses this Rank2Up in a parallel flipping framework; Section 5 reports higher success rates than two baselines on 530 More-Wild instances.

Significance. The rank-2 structure observation in Theorem 1 is appealing, and a correct low-rank KKT update would be a useful contribution to model-based DFO. However, the central update formula is algebraically false, so the complexity claim and the numerical results built on it are not established. The benchmark protocol is standard, but no code or complete results figure is supplied in the text under review. The paper's potential significance is real, but the current manuscript does not support it.

major comments (3)

[§3.2, Eq. (6)] The claimed Sherman-Morrison-Woodbury formula is incorrect. For W=I_2, e=e_1, w=2e_1, ΔW=e w^T+w e^T gives W+ΔW=diag(5,1), so H_new=diag(1/5,1). Substituting into Eq. (6): α=1, Hw=2e, e−Hw=−e, β=−2, τ=2, σ=2, yielding H_new=diag(1/2,1). This is not the true inverse. The exact SMW update for e w^T+w e^T contains additional H w w^T H and cross terms; Eq. (6) as written is not equivalent. Since Algorithm 1's Rank2Up and the O(n^2) complexity claim rest on Eq. (6), the core contribution of the paper is invalidated.
[Algorithm 1, Steps 4–9] The algorithm is not well-defined without an unflagged assumption. Step 4 flips one coordinate of every point in X. Step 6 solves the KKT system for the new model, whose residual vector in Eq. (3) is r_i = f(x'_i) - Q_old(x'_i). The paper never states where f(x'_i) is obtained; Step 9 evaluates f on the same flipped set, but Step 6 needs these values earlier. If the intended assumption is f(flip(x_i)) = f(x_i) or that flipped-point values are available without cost, it must be stated and tested. As written, the model update and internal trust-region steps are undefined or rely on an unstated symmetry.
[§3.2 and §2.2] Even setting Eq. (6) aside, the claimed O(n^2) cost is not justified for the stated problem class. Eq. (6) multiplies dense H ∈ R^{p×p}, p = m+n+1, so each update costs O(p^2) = O(m^2). The paper allows m up to (n+1)(n+2)/2 in §2.1; O(n^2) holds only if m = O(n). Algorithm 1 happens to initialize m = 2n+1, but the theorem and complexity claim are presented generally. The authors should either restrict the claim to m = O(n) or derive a genuinely O(n^2) procedure.

minor comments (3)

[§5 / Figure 2] The text refers to 'Figures 2' for data profiles, but no actual profile plots or tables are present in the submitted text; the numerical claims cannot be checked. The baselines 'Large-Scale' and 'QARSTA' are not specified with versions or parameters.
[Algorithm 1 / notation] The vector w entering Rank2Up is not defined precisely for either the point-replacement or coordinate-flip update. In particular, the halving of the diagonal element mentioned in §3.1 is not reflected in a formula, making the implementation ambiguous.
[Throughout] The text contains small notation slips: 'old' and 'new' in §2.1 are not carefully mapped to the k/(k+1) indices, and the sentence '0∈R^{(n+1)×(n+1)}' in Eq. (3) should be the zero block of dimension (n+1)×(n+1).

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the low-rank KKT update is derived algebraically, and numerical benchmarks are external; prior self-citations are contextual only.

full rationale

The paper's central mechanism is a matrix-algebra derivation. Theorem 1 constructs the coordinate flip from the condition that the A-block remain unchanged, and Eq. (5) decomposes the induced perturbation as e_k w^T + w e_k^T. Eq. (6) is then claimed as a Sherman-Morrison-Woodbury consequence; even if the stated coefficients do not match the standard Woodbury expansion (a correctness concern rather than a circularity concern), the formula is not obtained by fitting a parameter to the quantity it is supposed to predict, nor by assuming the desired rank-2 update. The inverse update is not defined in terms of its own output. The numerical experiments use the external Moré–Wild benchmark set and standard data/performance profile definitions, so the reported success rates are not fitted restatements of the model update. References to the authors' earlier work (refs. 3, 9–15) appear in the introduction and reference list; none is invoked as the proof of Eq. (6), the rank-2 structure, or the parallel flipping mechanism. Algorithm 1 does contain an unstated assumption about the availability of f-values at flipped points, and Eq. (6) is asserted without a derivation; these are omitted-support/correctness flags, but they do not make the derivation circular. No step in the claimed derivation chain reduces to its own input by construction.

Assumptions & free parameters 2 free parameters · 4 assumptions · 0 invented entities

The paper's mathematics rests on the standard least-Frobenius KKT representation and Woodbury inversion; the only hand-chosen constants are trust-region and inner-loop parameters. The main unstated load-bearing assumption is that flipped points' function values are known. No genuinely new entities are introduced.

free parameters (2)

Inner-loop steps S = 10
Algorithm 1 sets S=10 inner trust-region steps per parallel machine; hand-chosen, not swept or justified.
Trust-region parameters γ, η1, η2 = γ=2, η1=0.25, η2=0.75
Standard Powell constants; not fitted to the benchmark, but their effect on the claimed success rates is not reported.

assumptions (4)

domain assumption The KKT system (3) with W=[A X^T; X 0] and W^{-1} correctly represents the least-Frobenius model update.
Used throughout §2-3; the paper does not fully derive W from the KKT conditions.
standard math Sherman-Morrison-Woodbury identity is the correct tool for inverting W+ΔW.
Invoked in §3.2, but Eq. (6) does not match the identity and fails counterexamples.
domain assumption The interpolation set remains poised and W remains invertible after coordinate-axis flipping.
Needed for H update and model uniqueness; not established for arbitrary random flips.
ad hoc to paper Objective-function values at flipped points are available or f(flip(x_i))=f(x_i).
Algorithm 1 Steps 6 and 9 require residuals and evaluations on the flipped set that are never obtained.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Low-Rank KKT Updates and a Parallel Flipping Mechanism for Model-Based Derivative-Free Optimization." pith.science (2026). https://pith.science/paper/RNZWP7UQ

@misc{pith2026260722538,
  author       = {Pith},
  title        = {Pith review of: Low-Rank KKT Updates and a Parallel Flipping Mechanism for Model-Based Derivative-Free Optimization},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/RNZWP7UQ}},
  note         = {Machine review of arXiv:2607.22538}
}

abstract

Model-based derivative-free optimization relies on quadratic interpolation, but maintaining these models typically requires $\mathcal{O}(m^3)$ linear system solves. We show that for the least Frobenius norm updating model, the associated KKT matrix possesses a fixed inner-product structure. Both single-point replacements and a proposed coordinate-axis flipping operation induce exact Rank-2 perturbations to this matrix. Using this structure, we derive an $\mathcal{O}(n^2)$ update formula for the KKT inverse, eliminating costly refactorizations at each iteration. We integrate the update into a parallel trust-region algorithm where workers independently flip interpolation axes, refresh local models, and synchronize the best configuration. Tests on 530 benchmark problems show the method reduces model-maintenance overhead and achieves higher success rates under tight function-evaluation budgets compared to standard solvers.

Figures

Figures reproduced from arXiv: 2607.22538 by the authors.

**Figure 2.** Data profiles δ(β) for the 530 test problems under varying accuracy tolerance levels τ . The xaxis indicates the normalized budget β = Nf /(n + 1). 5. NUMERICAL EXPERIMENTS To evaluate the parallel flipping mechanism, we conduct experiments on the classic derivative-free benchmark set by Mor´e and Wild [5]. The set comprises 53 unique problems (n ∈ [2, 12]) with 10 variations (e.g., smooth, nondifferentiable, and… view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

299 extracted references · 27 canonical work pages

[1]

2025 , eprint=

Privacy-Preserving Black-Box Optimization (PBBO): Theory and the Model-Based Algorithm DFOp , author=. 2025 , eprint=

2025
[2]

Wild , year=

Pengcheng Xie and Stefan M. Wild , year=. 2504.03606 , archivePrefix=

arXiv
[3]

2025 , eprint=

A novel numerical method tailored for unconstrained optimization problems , author=. 2025 , eprint=

2025
[4]

IMA Journal of Numerical Analysis , volume =

Xie, Pengcheng and Yuan, Yaxiang , title =. IMA Journal of Numerical Analysis , volume =. 2026 , month =. doi:10.1093/imanum/drae106 , url =

doi:10.1093/imanum/drae106 2026
[5]

2025 , journal=

A spectral Levenberg-Marquardt-Deflation method for multiple solutions of semilinear elliptic systems , author=. 2025 , journal=

2025
[6]

2025 , url=

An Improved Adaptive Orthogonal Basis Deflation Method for Multiple Solutions with Applications to Nonlinear Elliptic Equations in Varying Domains , author=. 2025 , url=

2025
[7]

2025 , eprint=

Objective Value Change and Shape-Based Accelerated Optimization for the Neural Network Approximation , author=. 2025 , eprint=

2025
[8]

Wild , title =

Pengcheng Xie and Stefan M. Wild , title =. 2024 , journal =

2024

Show all 299 references

[9]

2025 , eprint=

Model-Driven Subspaces for Large-Scale Optimization with Local Approximation Strategy , author=. 2025 , eprint=

2025
[10]

, title =

Pengcheng Xie, etc. , title =. 2024 , journal =

2024
[11]

2024 , eprint=

On the Relationship between -poisedness in Derivative-Free Optimization and Outliers in Local Outlier Factor , author=. 2024 , eprint=

2024
[12]

K. J. Dzahini and S. M. Wild and P. Xie , title =. 2025 , note =

2025
[13]

Hu and P

W. Hu and P. Xie and L. Zhang and Y.-x. Yuan , title =. 2024 , url =

2024
[14]

Optimization Methods and Software , volume =

Pengcheng Xie and Ya-xiang Yuan , title =. Optimization Methods and Software , volume =. 2026 , publisher =. doi:10.1080/10556788.2025.2601670 , URL =

2026
[15]

SIAM Journal on Optimization , volume =

Xie, Pengcheng and Yuan, Yaxiang , title =. SIAM Journal on Optimization , volume =. 2025 , doi =. https://doi.org/10.1137/23M1582023 , abstract =

2025 doi
[16]

Xie and Y

P. Xie and Y. Yuan , title =. Journal of the Operations Research Society of China , year =
[17]

Xie and Y.-x

P. Xie and Y.-x. Yuan , title =. Chinese Annals of Mathematics, Series B , volume =. 2023 , url1 =

2023
[18]

Xie , title =

P. Xie , title =. Journal of Physics: Conference Series , volume =. 2023 , url =

2023
[20]

An efficient derivative-free method for finding multiple solutions , year =
[21]

Li and P

S. Li and P. Xie and Z. Zhou, et al. , title =. 2021 7th International Conference on Computer and Communications (ICCC) , year =. doi:10.1109/ICCC54389.2021.9674410 , url =

2021
[22]

Xie and M

P. Xie and M. Tao , title =. 2019 American Control Conference (ACC) , year =. doi:10.23919/ACC.2019.8814709 , url =

2019
[23]

Xie , title =

P. Xie , title =. 2024 , doi =

2024
[24]

Applied and Computational Mathematics , volume =

Pengcheng Xie , title =. Applied and Computational Mathematics , volume =. 2024 , keywords =. doi:10.11648/j.acm.20241305.13 , url =. https://article.sciencepublishinggroup.com/pdf/10.11648.j.acm.20241305.13 , abstract =

2024 doi
[25]

and Cant\'

Pelikan, Martin and Goldberg, David E. and Cant\'. Proceedings of the 1st Annual Conference on Genetic and Evolutionary Computation - Volume 1 , pages =. 1999 , isbn =

1999
[26]

1987 , publisher=

Simulated Annealing: Theory and Applications , author=. 1987 , publisher=

1987
[27]

Response Surface Methodology (

Bezerra, Marcos and Santelli, Ricardo and Oliveira, Eliane and Villar, Leonardo and Escaleira, Luciane , year =. Response Surface Methodology (. doi:10.1016/j.talanta.2008.05.019 , journal =

2008 doi
[28]

SIAM Journal on Optimization , volume =

Xie, Pengcheng and Yuan, Yaxiang , title =. SIAM Journal on Optimization , volume =. 2025 , doi =

2025
[29]

2025 , issn =

Sufficient conditions for error distance reduction in the ^2 -norm trust region between minimizers of local nonconvex multivariate quadratic approximates , journal =. 2025 , issn =. doi:https://doi.org/10.1016/j.cam.2024.116146 , author =

2025
[30]

and Vicente, L

Rinaldi, F. and Vicente, L. N. and Zeffiro, D. , title =. SIAM Journal on Optimization , volume =. 2024 , doi =

2024
[31]

2021 , issn =

Two decades of blackbox optimization applications , journal =. 2021 , issn =. doi:10.1016/j.ejco.2021.100011 , author=

2021
[32]

2025 , publisher=

Derivative-Free Optimization with Transformed Objective Functions and the Algorithm Based on the Least. 2025 , publisher=. doi:10.1007/s40305-023-00532-x , journal=

2025 doi
[33]

Optimization Methods and Software , volume =

Xie, Pengcheng and Yuan, Yaxiang , title =. Optimization Methods and Software , volume =. 2026 , publisher =

2026
[34]

Chinese Annals of Mathematics, Series B , volume=

A Derivative-Free Optimization Algorithm Combining Line-Search and Trust-Region Techniques , author=. Chinese Annals of Mathematics, Series B , volume=. 2023 , doi=

2023
[35]

doi:10.17226/26894 , publisher =

Foundational Research Gaps and Future Directions for Digital Twins , ISBN =. doi:10.17226/26894 , publisher =

doi
[36]

European Journal of Operational Research , author =

Performance indicators in multiobjective optimization , volume =. European Journal of Operational Research , author =. 2021 , pages =. doi:10.1016/j.ejor.2020.11.016 , number =

2021 doi
[37]

2024 , journal =

Jeffrey Larson and Matt Menickelly , title =. 2024 , journal =. doi:10.1007/s12532-023-00245-5 , volume =

2024 doi
[38]

ACM Transactions on Evolutionary Learning and Optimization , author =

Multi-Objective Hyperparameter Optimization in Machine Learning -- An Overview , volume =. ACM Transactions on Evolutionary Learning and Optimization , author =. 2023 , pages =. doi:10.1145/3610536 , number =

2023 doi
[39]

Wild , title =

Ashish Tripathi and Zichao Wendy Di and Zhang Jiang and Stefan M. Wild , title =. 2024 , pages =. doi:10.1364/OE.530136 , journal =

2024 doi
[40]

Latency considerations for stochastic optimizers in variational quantum algorithms , volume =

Menickelly, Matt and Ha, Yunsoo and Otten, Matthew , year =. Latency considerations for stochastic optimizers in variational quantum algorithms , volume =. doi:10.22331/q-2023-03-16-949 , journal =

2023 doi
[41]

, year =

Bush, Vannevar and Holt, Rush D. , year =. Science, the Endless Frontier , ISBN =. doi:10.2307/j.ctv15r5879 , publisher =

doi
[42]

SIAM Review , author =

Research and Education in Computational Science and Engineering , volume =. SIAM Review , author =. 2018 , pages =. doi:10.1137/16m1096840 , number =

2018 doi
[43]

Miller, William L. and Bard, Deborah and Boehnlein, Amber and Fagnan, Kjiersten and Guok, Chin and Lançon, Eric and Ramprakash, Sreeranjani and Shankar, Mallikarjun and Schwarz, Nicholas and Brown, Benjamin L. , institution =
[44]

and Mohror, Kathryn and Settlemyer, Bradley and Wolf, Matthew , url =

Ross, Robert and Ward, Lee and Carns, Philip and Grider, Gary and Klasky, Scott and Koziol, Quincey and Lockwood, Glenn K. and Mohror, Kathryn and Settlemyer, Bradley and Wolf, Matthew , url =
[45]

and Hammond, Simon David and Hoisie, Adolfy and Karlin, Ian and Pakin, Scott and Shalf, John and Vetter, Jeffrey S

Ang, James and Chien, Andrew A. and Hammond, Simon David and Hoisie, Adolfy and Karlin, Ian and Pakin, Scott and Shalf, John and Vetter, Jeffrey S. , type =
[46]

Scott and Hoisie, Adolfy and Newton, Benjamin and Nutaro, James and Oppelstrup, Tomas and Ross, Robert and Schordan, Markus and Urban, Nathan , url =

Perumalla, Kalyan and Barnes, Peter and Bremer, Maximilian and Brown, Kevin and Chan, Cy and Eidenbenz, Stephan and Hemmert, K. Scott and Hoisie, Adolfy and Newton, Benjamin and Nutaro, James and Oppelstrup, Tomas and Ross, Robert and Schordan, Markus and Urban, Nathan , url =
[47]

and Bernholdt, David E

Heroux, Michael A. and Bernholdt, David E. and McInnes, Lois Curfman and Cary, John R. and Katz, Daniel S. and Raybourn, Elaine M. and Rouson, Damian , type =
[48]

Byna, Suren and Idreos, Stratos and Jones, Terry and Mohror, Kathryn and Ross, Rob and Rusu, Florin , url =
[49]

2020 , month =

Hendrickson, Bruce and Bland, Buddy and Chen, Jackie and Colella, Phil and Dart, Eli and Dongarra, Jack and Dunning, Thom and Foster, Ian and Gerber, Richard and Harken, Rachel and Huntoon, Wendy and Johnston, Bill and Sarrao, John and Vetter, Jeff , url =. 2020 , month =

2020
[50]

Bruce Hendrickson and Alejandro Aceves and Elie Alhajjar and Mario Ba\
[51]

Meza and Daniel A

Roscoe Giles and Jay Bardhan and Alan Edelman and Fred Johnson and Alexandra Landsberg and Richard Lethin and David Levermore and Juan C. Meza and Daniel A. Reed , url =. Transitioning
[52]

Carter, Jonathan and Feddema, John and Kothe, Doug and Neely, Rob and Pruet, Jason and Stevens, Rick and Balaprakash, Prasanna and Beckman, Pete and Foster, Ian and Iskra, Kamil and Ramanathan, Arvind and Taylor, Valerie and Thakur, Rajeev and Agarwal, Deb and Crivelli, Silvia...
[53]

Broz, Joe and Byrd, Mark and Chembo, Yanne and de Jong, Bert and Figueroa, Eden and Humble, Travis and Larson, Jeffrey and Lougovski, Pavel and Parekh, Ojas and Quiroz, Greg and Svore, Krysta , adoi =
[54]

Shao , School =

Z. Shao , School =. On Random Embeddings and their Applications to Optimization , Year =
[55]

arXiv , Year =

Coralia Cartis and Jaroslav Fowkes and Zhen Shao , Title =. arXiv , Year =
[56]

Wild , title =

Stephen Hudson and Jeffrey Larson and John-Luke Navarro and Stefan M. Wild , title =. International Journal of High Performance Computing Applications , year =. doi:10.1177/10943420241298297 , aurl =

doi
[57]

Wes Brewer and Ana Gainaru and Frédéric Suter and Feiyi Wang and Murali Emani and Shantenu Jha , year=
[58]

2024 , number =

Jeffrey Larson and Matt Menickelly and Jiahao Shi , title =. 2024 , number =

2024
[59]

Wild and Witold Nazarewicz , title =

Paul-Gerhard Reinhard and Jared O'Neal and Stefan M. Wild and Witold Nazarewicz , title =. Journal of Physics G: Nuclear and Particle Physics , year =. doi:10.1088/1361-6471/ad633a , aurl =

doi
[60]

Methods and Applications of Autonomous Experimentation , ISBN =

Noack, Marcus and Ushizima, Daniela , year =. Methods and Applications of Autonomous Experimentation , ISBN =. doi:10.1201/9781003359593 , publisher =

doi
[61]

2023 , title =

Noack, Marcus M and Krishnan, Harinarayan and Risser, Mark D and Reyes, Kristofer G , journal =. 2023 , title =. doi:10.1038/s41598-023-30062-8 , pages =

2023 doi
[62]

Wild and Moses Y-H

Matthew Plumlee and \"Ozge S\"urer and Stefan M. Wild and Moses Y-H. Chan , title =. 2023 , url =

2023
[63]

Baraldi and Sven Leyffer and Stefan M

Robert J. Baraldi and Sven Leyffer and Stefan M. Wild , title =. 2024 , url =

2024
[64]

Basic Research Needs in Quantum Computing and Networking , author =
[65]

2023 , url =

A selection of. 2023 , url =

2023
[66]

Wild , title =

Stephen Hudson and Jeffrey Larson and John-Luke Navarro and Stefan M. Wild , title =. doi:10.21105/joss.06031 , year =

doi
[67]

doi:10.1007/s11081-020-09571-2 , year =

Yasunori Aoki and Ken Hayami and Kota Toshimoto and Yuichi Sugiyama , title =. doi:10.1007/s11081-020-09571-2 , year =

doi
[68]

Liu, Xiaoyuan and Angone, Anthony and Shaydulin, Ruslan and Safro, Ilya and Alexeev, Yuri and Cincio, Lukasz , journal=. Layer. 2022 , doi=

2022
[69]

Chang and Paris Franz and Stephen Hudson and Jeffrey Larson , title =

Nicole Neveu and Tyler H. Chang and Paris Franz and Stephen Hudson and Jeffrey Larson , title =. doi:10.1016/j.cpc.2022.108566 , year =

2022
[70]

Wild and Natalia Zuniga-Garcia and Joshua Auld , journal=

Damola Akinlana and Arindam Fadikar and Stefan M. Wild and Natalia Zuniga-Garcia and Joshua Auld , journal=. O'Hare Airport Roadway Traffic Prediction via Data Fusion and. 2024 , pages=

2024
[71]

Biometrika , volume=

Weighted finite population sampling to maximize entropy , author=. Biometrika , volume=. doi:10.1093/biomet/81.3.457 , pages=

doi
[72]

General properties and estimation of conditional

Chen, Sean X , journal=. General properties and estimation of conditional. doi:10.1006/jmva.1999.1872 , number=

1999
[73]

Tracking the gradients using the

Gower, Robert and Le Roux, Nicolas and Bach, Francis , booktitle=. Tracking the gradients using the. 2018 , organization=

2018
[74]

Transactions on Machine Learning Research , issn=

Bayesian Optimization with Informative Covariance , author=. Transactions on Machine Learning Research , issn=. 2023 , url=

2023
[75]

doi:10.1145/3531146.3533229 , year = 2022, author =

Predictability and Surprise in Large Generative Models , booktitle =. doi:10.1145/3531146.3533229 , year = 2022, author =

2022
[76]

2023 , number=

Model evaluation for extreme risks , author=. 2023 , number=

2023
[77]

Bowman and Zac Hatfield-Dodds and Ben Mann and Dario Amodei and Nicholas Joseph and Sam McCandlish and Tom Brown and Jared Kaplan , year=

Yuntao Bai and Saurav Kadavath and Sandipan Kundu and Amanda Askell and Jackson Kernion and Andy Jones and Anna Chen and Anna Goldie and Azalia Mirhoseini and Cameron McKinnon and Carol Chen and Catherine Olsson and Christopher Olah and Danny Hernandez and Dawn Drain and Deep ...
[78]

Jihao Xin and Marco Canini and Peter Richt\'arik and Samuel Horv\'ath , year=. Global-
[79]

2007 , volume =

Francesco Mezzadri , title =. 2007 , volume =

2007
[80]

doi:10.1145/3545611 , year =

Micka\"el Binois and Nathan Wycoff , title =. doi:10.1145/3545611 , year =

doi
[81]

Gramacy , year=

Annie Sauer and Andrew Cooper and Robert B. Gramacy , year=. Non-stationary
[82]

arvenp\"a\

Marko J\"arvenp\"a\"a and Michael U. Gutmann and Aki Vehtari and Pekka Marttinen , year=. Parallel. Bayesian Analysis , publisher=. doi:10.1214/20-BA1200 , number=

doi
[83]

, title =

S\"urer, \"Ozge and Plumlee, Matthew and Wild, Stefan M. , title =. Technometrics , anumber =. 2024 , pages =. doi:10.1080/00401706.2023.2246157 , number =

2024
[84]

First-Order Methods for Sparse Covariance Selection , volume =

Alexandre. First-Order Methods for Sparse Covariance Selection , volume =. 2008 , doi =

2008
[85]

See homepage for a complete list of the people involved , title =
[86]

arXiv:1810.00001 , year =

The Photometric. arXiv:1810.00001 , year =

arXiv
[87]

doi:10.1038/nphys3272 , year =

Scott Aaronson , title =. doi:10.1038/nphys3272 , year =

doi
[88]

Linderoth , title =

Kumar Abhishek and Sven Leyffer and Jeffrey T. Linderoth , title =. 2010 , doi =

2010
[89]

URL https://doi

Qiskit: An open-source framework for quantum computing , author=. URL https://doi. org/10.5281/zenodo , volume=. 2019 , doi=

2019 doi
[90]

Petter Abrahamsen , title =
[91]

Abramson , title =

Mark A. Abramson , title =. 2004 , doi =

2004
[92]

Abramson , title =

Mark A. Abramson , title =. 2005 , doi =

2005
[93]

Abramson and Thomas J

Mark A. Abramson and Thomas J. Asaki and John E. An efficient class of direct search surrogate methods for solving expensive optimization problems with. 2011 , doi =

2011
[94]

Abramson and Charles Audet , title =

Mark A. Abramson and Charles Audet , title =. 2006 , doi =

2006
[95]

and Audet, Charles and Chrissis, James W

Abramson, Mark A. and Audet, Charles and Chrissis, James W. and Walston, Jennifer , title =. 2009 , doi =

2009
[96]

Abramson and C

Mark A. Abramson and C. Audet and G. Couture and John E. The. 2014 , url =

2014
[97]

Abramson and Charles Audet and John E

Mark A. Abramson and Charles Audet and John E. Generalized pattern searches with derivative information , volume =. 2004 , doi =

2004
[98]

Abramson and Charles Audet and John E

Mark A. Abramson and Charles Audet and John E. SIAG/Optimization Views and News , title =. 2006 , number =

2006
[99]

Abramson and Charles Audet and John E

Mark A. Abramson and Charles Audet and John E. Filter pattern search algorithms for mixed variable constrained optimization problems , volume =. 2007 , doi =

2007
[100]

Abramson and Audet, Charles and John E

Mark A. Abramson and Audet, Charles and John E. 2009 , doi =

2009
[101]

Abramson and Lennart Frimannslund and Trond Steihaug , title =

Mark A. Abramson and Lennart Frimannslund and Trond Steihaug , title =. 2013 , doi =

2013
[102]

Achtziger and C

W. Achtziger and C. Kanzow , title =. 2008 , doi =

2008
[103]

Nonlinear Chance Constrained Problems: Optimality Conditions, Regularization and Solvers , volume =

Luk. Nonlinear Chance Constrained Problems: Optimality Conditions, Regularization and Solvers , volume =. 2016 , doi =

2016
[104]

Adams and Lara E

Brian M. Adams and Lara E. Bauman and William J. Bohnhoff and Keith R. Dalbey and John P. Eddy and Mohamed S. Ebeida and Michael S. Eldred and Patricia D. Hough and Kenneth T. Hu and John D. Jakeman and Laura P. Swiler and Dena M. Vigil , title =. 2013 , url =

2013
[105]

Ryan Prescott Adams and Iain Murray and David J. C. Mac. The. Advances in Neural Information Processing Systems 21 , publisher =
[106]

2019 , doi =

Adcock, Ben and Bao, Anyi and Brugiapaglia, Simone , title =. 2019 , doi =

2019
[107]

2006 , doi =

Bernardetta Addis and Sven Leyffer , title =. 2006 , doi =

2006
[108]

2005 , doi =

Bernardetta Addis and Marco Locatelli and Fabio Schoen , title =. 2005 , doi =

2005
[109]

2013 , url =

Adelmann, Andreas and Gsell, Achim and Kaman, Tulin and Christof Kraus and Yves Ineichen and Steve Russell and Bi, Yuanjie and Wang, Chuan and Jianjun Yang and Hao Zha and Sheehy, Suzanne and Chris Rogers and Christopher Mayes , title =. 2013 , url =

2013
[110]

Automatic Differentiation in
[111]

Adorio, E. P. and Diliman, U. P. , title =
[112]

Journal of Statistical Mechanics: Theory and Experiment , volume=

Statistical mechanics of complex neural systems and high dimensional data , author=. Journal of Statistical Mechanics: Theory and Experiment , volume=. 2013 , publisher=

2013
[113]

and Dekel, O

Agarwal, A. and Dekel, O. and Xiao, L. , title =. 23rd Conference on Learning Theory , pages =. 2010 , gurl =

2010
[114]

Advances in Neural Information Processing Systems 24 , editor =

Agarwal, Alekh and Duchi, John C , title =. Advances in Neural Information Processing Systems 24 , editor =
[115]

Advances in Neural Information Processing Systems 24 , publisher =

Agarwal, Alekh and Foster, Dean P and Hsu, Daniel J and Kakade, Sham M and Rakhlin, Alexander , title =. Advances in Neural Information Processing Systems 24 , publisher =. 2011 , gurl =

2011
[116]

Wainwright , title =

Alekh Agarwal and Sahand Negahban and Martin J. Wainwright , title =. 2012 , doi =

2012
[117]

and Peter L

Agarwal, Alekh and Wainwright, Martin J. and Peter L. Bartlett and Pradeep K. Ravikumar , title =. Advances in Neural Information Processing Systems 22 , publisher =. 2009 , gurl =

2009
[118]

Proceedings of the 49th Annual

Naman Agarwal and Zeyuan Allen-Zhu and Brian Bullins and Elad Hazan and Tengyu Ma , title =. Proceedings of the 49th Annual. 2017 , doi =

2017
[119]

Proceedings of the International Conference on SuperComputing , pages =

Agarwal, R and Gustavson, F and Zubair, M , title =. Proceedings of the International Conference on SuperComputing , pages =
[120]

Lockwood Solvent Groundwater Plume , howpublished =
[121]

Data Streams: Models and Algorithms , publisher =

Aggarwal, Charu C , volume =. Data Streams: Models and Algorithms , publisher =
[122]

Aggarwal and Y

V. Aggarwal and Y. P. Aneja and K. P. K. Nair , title =. 1982 , doi =

1982
[123]

Joseph Agor and Osman Y. \". Feature Selection for Classification Models via Bilevel Optimization , year =. doi:10.1016/j.cor.2018.05.005 , journal =

2018 doi
[124]

2016 , doi =

Agostinho Agra and Marcio Costa Santos and Dritan Nace and Michael Poss , title =. 2016 , doi =

2016
[125]

Advances in Applied Probability , publisher =

Rajeev Agrawal , title =. Advances in Applied Probability , publisher =. 1995 , doi =

1995
[126]

1995 , doi =

Agrawal, Rajeev , title =. 1995 , doi =

1995
[127]

doi:10.1007/s11222-021-10000-2 , year =

Christian Agrell and Kristina Rognlien Dahl , title =. doi:10.1007/s11222-021-10000-2 , year =

doi
[128]

IEEE International Symposium on Parallel and Distributed Processing (IPDPS) , pages =

Ahmad, Ishfaq and Ranka, Sanjay and Khan, Samee Ullah , title =. IEEE International Symposium on Parallel and Distributed Processing (IPDPS) , pages =. 2008 , doi =

2008
[129]

doi:10.1007/s10107-019-01411-1 , year =

Amir Ali Ahmadi and Jeffrey Zhang , title =. doi:10.1007/s10107-019-01411-1 , year =

doi
[130]

Algorithms to find exact inclusion probabilities for conditional

Aires, Nibia , journal=. Algorithms to find exact inclusion probabilities for conditional. 1999 , doi=

1999
[131]

Aithal and Stefan M

Shashi M. Aithal and Stefan M. Wild , title =. Proceedings of the SAE 11th International Conference on Engines & Vehicles , apublisher =. 2013 , doi =

2013
[132]

Aithal and Stefan M

Shashi M. Aithal and Stefan M. Wild , title =. Proceedings of the SAE 12th International Conference on Engines & Vehicles , apublisher =. 2015 , doi =

2015
[133]

Aithal and Stefan M

Shashi M. Aithal and Stefan M. Wild , title =. High Performance Computing (ISC-HPC 2015) , editor =. 2015 , doi =

2015
[134]

2015 , publisher=

Akbari, Z and Yousefpour, Rohollah and Peyghami, M Reza , journal=. 2015 , publisher=. doi:10.1007/s10957-014-0534-6 , title=

2015 doi
[135]

2010 , doi =

Modeling and optimization with. 2010 , doi =

2010
[136]

Shoemaker , title =

Taimoor Akhtar and Christine A. Shoemaker , title =. 2015 , doi =

2015
[137]

Selection of Variables in Parallel Space Decomposition for the Mesh Adaptive Direct Search Algorithm , institution =

St\'ephane Alarie and Nadir Amaioua and Charles Audet and S\'ebastien. Selection of Variables in Parallel Space Decomposition for the Mesh Adaptive Direct Search Algorithm , institution =. 2018 , gurl =

2018
[138]

Optimization of noisy blackboxes with adaptive precision , institution =

St\'ephane Alarie and Charles Audet and Pierre-Yves Bouchet and S\'ebastien. Optimization of noisy blackboxes with adaptive precision , institution =. 2019 , url =

2019
[139]

Snow Water Equivalent Estimation Using Blackbox Optimization , volume =

St\'ephane Alarie and Charles Audet and Vincent Garnier and S\'ebastien. Snow Water Equivalent Estimation Using Blackbox Optimization , volume =. 2013 , journal =

2013
[140]

2021 , number=

Hierarchically constrained blackbox optimization , author=. 2021 , number=

2021
[141]

Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages =

Albers, Susanne and Antoniadis, Antonios , title =. Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages =. 2012 , doi =

2012
[142]

and Chib, Siddhartha , title =

Albert, James H. and Chib, Siddhartha , title =. 1993 , doi =

1993
[143]

Vicente , title =

Pedro Alberto and Fernando Nogueira and Humberto Rocha and Lu\'is N. Vicente , title =. 2004 , doi =

2004
[144]

On the Application of

Abdullah. On the Application of. 2018 , url =

2018
[145]

A trust region framework for managing the use of approximation models in optimization , volume =

Natalia Alexandrov and John E. A trust region framework for managing the use of approximation models in optimization , volume =. 1998 , doi =

1998
[146]

Alexandrov, N. M. and Lewis, R. M. , title =. 1999 , url =

1999
[147]

Montaz Ali and Charoenchai Khompatraporn and Zelda B

M. Montaz Ali and Charoenchai Khompatraporn and Zelda B. Zabinsky , title =. 2005 , doi =

2005
[148]

Briand and Hadi Hemmati and Rajwinder Kaur Panesar-Walawege , journal =

Shaukat Ali and Lionel C. Briand and Hadi Hemmati and Rajwinder Kaur Panesar-Walawege , journal =. A Systematic Review of the Application and Empirical Investigation of Search-Based Test Case Generation , year =
[149]

Allen-Zhu and E

Z. Allen-Zhu and E. Hazan , title =. International Conference on Machine Learning , year =
[150]

doi:10.1007/s10107-019-01464-2 , year =

Zeyuan Allen-Zhu and Yuanzhi Li and Aarti Singh and Yining Wang , title =. doi:10.1007/s10107-019-01464-2 , year =

doi
[151]

20th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP) , pages =

Alonso, Pedro and Dolz, Manuel F and Igual, Francisco D and Mayo, Rafael and Quintana-Orti, Enrique S , title =. 20th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP) , pages =
[152]

Linderoth and Zhen Xie , title =

Mine Altunay and Sven Leyffer and Jeffrey T. Linderoth and Zhen Xie , title =. 2011 , doi =

2011
[153]

Srivastava , booktitle =

Moustafa Alzantot and Yash Sharma and Supriyo Chakraborty and Huan Zhang and Cho-Jui Hsieh and Mani B. Srivastava , booktitle =. doi:10.1145/3321707.3321749 , publisher =
[154]

Conn and S

Nadir Amaioua and Charles Audet and Andrew R. Conn and S. Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm , volume =. 2018 , doi =

2018
[155]

Sahinidis and Bikram Sharda and Scott J

Satyajith Amaran and Nikolaos V. Sahinidis and Bikram Sharda and Scott J. Bury , title =. 2015 , doi =

2015
[156]

Amos and David R

Brandon D. Amos and David R. Easterling and Layne T. Watson and Brent S. Castle and Michael W. Trosset and William I. Thacker , title =. Proceedings of the High Performance Computing Symposium , number =. 2014 , url =

2014
[157]

and Spentzouris, P

Amundson, J. and Spentzouris, P. and Qiang, J. and Ryne, R. , title =. 2006 , doi =

2006
[158]

2009 , doi =

Amundson, J F and Macridin, A and Spentzouris, P and Stern, E G , title =. 2009 , doi =

2009
[159]

Anagnostopoulos and R

C. Anagnostopoulos and R. B. Gramacy , title =
[160]

1995 , location =

Anderson, E and Bai, Z and Bischof, C and Demmel, J and Dongarra, J and Croz, J Du and Greenbaum, A and Hammarling, S and McKenney, A and Ostrouchov, S and Sorensen, D , edition =. 1995 , location =

1995
[161]

Anderson and Michael C

Edward J. Anderson and Michael C. Ferris , title =. 2001 , doi =

2001
[162]

H. L. Anderson , title =. 1986 , doi =

1986
[163]

1975 , doi =

Ned Anderson and Ilkka Karasalo , title =. 1975 , doi =

1975
[164]

R. L. Anderson , title =. 1953 , doi =

1953
[165]

Proceedings of the ACM/IEEE SC99 Conference on High Performance Networking and Computing , publisher =

Anderson, W K and Gropp, William D and Kaushik, D K and Keyes, D E and Smith, B F , title =. Proceedings of the ACM/IEEE SC99 Conference on High Performance Networking and Computing , publisher =
[166]

R. S. Anderssen and P. Bloomfield , title =. 1975 , doi =

1975
[167]

Andreani and E

R. Andreani and E. G. Birgin and J. M. Mart\'inez and M. L. Schuverdt , title =. 2007 , doi =

2007
[168]

Andreani and E

R. Andreani and E. G. Birgin and J. M. Mart. On Augmented. 2007 , doi =

2007
[169]

doi:10.1162/neco_a_01157 , year =

Andersen Man Shun Ang and Nicolas Gillis , title =. doi:10.1162/neco_a_01157 , year =

doi
[170]

Hardware-Software Co-Design for High Performance Computing (Co-HPC), 2014 , pages =

Ang, JA and Barrett, Richard F and Benner, RE and Burke, D and Chan, C and Cook, J and Donofrio, David and Hammond, Simon D and Hemmert, Karl S and Kelly, SM and others , title =. Hardware-Software Co-Design for High Performance Computing (Co-HPC), 2014 , pages =

2014
[171]

Hovland and Osni Marques and Lois

James Ang and Katherine Evans and Al Geist and Michael Heroux and Paul D. Hovland and Osni Marques and Lois. Report on the Workshop on Extreme-Scale Solvers: Transition to Future Architectures , institution =. 2012 , url =

2012
[172]

Antoulas , year =

Athanasios C. Antoulas , year =. Approximation of Large-Scale Dynamical Systems , publisher =
[173]

A. C. Antoulas and C. A. Beattie and S. G\". doi:10.1137/1.9781611976083 , year =

doi
[174]

Burke and Alessandro Chiuso and Gianluigi Pillonetto , title =

Aleksandr Aravkin and James V. Burke and Alessandro Chiuso and Gianluigi Pillonetto , title =. 2014 , journal =

2014
[175]

2017 , url =

Aravkin, Aleksandr and Davis, Damek , title =. 2017 , url =

2017
[176]

Friedlander and Felix J

Aleksandr Aravkin and Michael P. Friedlander and Felix J. Herrmann and Tristan. Robust inversion, dimensionality reduction, and randomized sampling , volume =. 2012 , doi =

2012
[177]

Aravkin and James V

Aleksandr Y. Aravkin and James V. Burke and Dmitry Drusvyatskiy and Michael P. Friedlander and Scott Roy , title =. 2019 , doi =

2019
[178]

Archetti and F

F. Archetti and F. Schoen , title =. 1984 , doi =

1984
[179]

Proceedings of the 34th International Conference on Machine Learning , editor =

Martin Arjovsky and Soumith Chintala and L. Proceedings of the 34th International Conference on Machine Learning , editor =. 2017 , url =

2017
[180]

1966 , doi =

Armijo, Larry , title =. 1966 , doi =

1966
[181]

Journal of Statistical Planning and Inference , author=

Bayesian emulation of complex multi-output and dynamic computer models , volume=. Journal of Statistical Planning and Inference , author=. 2010 , pages=. doi:10.1016/j.jspi.2009.08.006 , number=

2010 doi
[182]

Active-set strategy in

Aroux\'. Active-set strategy in. 2011 , doi =

2011
[183]

Roshan Joseph and Dianpeng Wang and Li Gu and Shiji Lyu and Rui Tuo , journal=

V. Roshan Joseph and Dianpeng Wang and Li Gu and Shiji Lyu and Rui Tuo , journal=. Deterministic Sampling of Expensive Posteriors Using Minimum Energy Designs , year=
[184]

Adaptive Quadrature Schemes for

Fern\'andez, Fernando Llorente and Martino, Luca and Elvira, Victor and Delgado, David and L\'opez-Santiago, Javier , journal=. Adaptive Quadrature Schemes for. 2020 , volume=

2020
[185]

Ma. Bel. Inexact Restoration Method for Nonlinear Optimization without Derivatives , volume =. 2015 , doi =

2015
[186]

Oktem and Carola-Bibiane Sch\

Simon Arridge and Peter Maass and Ozan \"Oktem and Carola-Bibiane Sch\"onlieb , title =. 2019 , doi =

2019
[187]

Palem and Eli Upfal and Ayush Bhargava and Parishkrati and Sreelatha Yenugula , title =

Guru Prakash Arumugam and Prashanth Srikanthan and John Augustine and Krishna V. Palem and Eli Upfal and Ayush Bhargava and Parishkrati and Sreelatha Yenugula , title =. year Conference Proceeding , pages =
[188]

Bardin and Rami Barends and Rupak Biswas and Sergio Boixo and Fernando G

Frank Arute and Kunal Arya and Ryan Babbush and Dave Bacon and Joseph C. Bardin and Rami Barends and Rupak Biswas and Sergio Boixo and Fernando G. S. L. Brandao and David A. Buell and Brian Burkett and Yu Chen and Zijun Chen and Ben Chiaro and Roberto Collins and William Court...

2019
[189]

Proceedings of the 2nd IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis , pages =

Ascia, Giuseppe and Catania, Vincenzo and Palesi, Maurizio , title =. Proceedings of the 2nd IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis , pages =. 2004 , doi =

2004
[190]

Euro-Par 2004 Parallel Processing: 10th International Euro-Par Conference , volume =

Ashby, T J and Kennedy, A D and O'Boyle, M F P , title =. Euro-Par 2004 Parallel Processing: 10th International Euro-Par Conference , volume =

2004
[191]

Amir Hossein Ashouri and Giovanni Mariani and Gianluca Palermo and Cristina Silvano , title =. 2014. 2014 , doi =

2014
[192]

2019 , doi =

Asi, Hilal and Duchi, John C , title =. 2019 , doi =

2019
[193]

Overton , title =

Azam Asl and Michael L. Overton , title =. 2020 , url =

2020
[194]

Attig and P

N. Attig and P. Gibbon and Th. Lippert , title =. 2011 , doi =

2011
[195]

2004 , doi =

Charles Audet , title =. 2004 , doi =

2004
[196]

2010 , doi =

Charles Audet , title =. 2010 , doi =

2010
[197]

Mathematics Without Boundaries: Surveys in Interdisciplinary Research , publisher =

Charles Audet , title =. Mathematics Without Boundaries: Surveys in Interdisciplinary Research , publisher =. 2014 , doi =

2014
[198]

Spent potliner treatment process optimization using a

Charles Audet and Vincent B. Spent potliner treatment process optimization using a. 2007 , doi =

2007
[199]

Audet and V

C. Audet and V. B\'echard and S\'ebastien. Nonsmooth optimization through Mesh Adaptive Direct Search and Variable Neighborhood Search , volume =. 2008 , doi =

2008
[200]

Performance indicators in multiobjective optimization , institution =

Charles Audet and Jean Bigeon and Dominique Cartier and S. Performance indicators in multiobjective optimization , institution =. 2018 , gurl =

2018
[201]

Monotonic grey box direct search optimization , journal =

Charles Audet and Pascal C. Monotonic grey box direct search optimization , journal =. doi:10.1007/s11590-019-01497-8 , year = 2019, publisher =

2019 doi
[202]

Audet and C.-K

C. Audet and C.-K. Dang and D. Orban , title =. Software Automatic Tuning: From Concepts to State-of-the-Art Results , publisher =. 2010 , doi =

2010
[203]

Audet and C.-K

C. Audet and C.-K. Dang and D. Orban , title =. 2011 , url =

2011
[204]

Audet and C.-K

C. Audet and C.-K. Dang and D. Orban , title =. 2013 , doi =

2013
[205]

2021 , number=

Charles Audet and S. 2021 , number=

2021
[206]

Linear Equalities in Blackbox Optimization , volume =

Charles Audet and S. Linear Equalities in Blackbox Optimization , volume =. 2015 , doi =

2015
[207]

2021 , url =

Quantifying uncertainty with ensembles of surrogates for blackbox optimization , author=. 2021 , url =

2021
[208]

The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables , volume =

Charles Audet and S. The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables , volume =. 2019 , doi =

2019
[209]

Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates , journal =

Charles Audet and Kwassi Joseph Dzahini and Michael Kokkolaras and. Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates , journal =. 2021 , volume =

2021
[210]

doi:10.48550/ARXIV.2204.00886 , author =

A general mathematical framework for constrained mixed-variable blackbox optimization problems with meta and categorical variables , institution =. doi:10.48550/ARXIV.2204.00886 , author =

doi arXiv
[211]

Hare , title =

Charles Audet and Warren L. Hare , title =. 2016 , doi =

2016
[212]

, aisbn =

Audet, Charles and Hare, Warren L. , aisbn =. Derivative-Free and Blackbox Optimization , publisher =. 2017 , doi =

2017
[213]

Hare , title =

Charles Audet and Warren L. Hare , title =. Numerical Nonsmooth Optimization , editor =. doi:10.1007/978-3-030-34910-3_19 , year = 2020, publisher =

2020 doi
[214]

Ianni and S\'ebastien

Charles Audet and A. Ianni and S\'ebastien. Reducing the Number of Function Evaluations in Mesh Adaptive Direct Search Algorithms , volume =. 2014 , doi =

2014
[215]

Robust optimization of noisy blackbox problems using the Mesh Adaptive Direct Search algorithm , volume =

Charles Audet and Amina Ihaddadene and S. Robust optimization of noisy blackbox problems using the Mesh Adaptive Direct Search algorithm , volume =. 2018 , doi =

2018
[216]

Pattern Search Algorithms for Mixed Variable Programming , volume =

Audet, Charles and John E. Pattern Search Algorithms for Mixed Variable Programming , volume =. 2000 , doi =

2000
[217]

Analysis of Generalized Pattern Searches , volume =

Charles Audet and John E. Analysis of Generalized Pattern Searches , volume =. 2002 , doi =

2002
[218]

A Pattern Search Filter Method for Nonlinear Programming without Derivatives , volume =

Charles Audet and John E. A Pattern Search Filter Method for Nonlinear Programming without Derivatives , volume =. 2004 , doi =

2004
[219]

Mesh Adaptive Direct Search Algorithms for Constrained Optimization , volume =

Charles Audet and John E. Mesh Adaptive Direct Search Algorithms for Constrained Optimization , volume =. 2006 , doi =

2006
[220]

A Progressive Barrier for Derivative-Free Nonlinear Programming , volume =

Charles Audet and John E. A Progressive Barrier for Derivative-Free Nonlinear Programming , volume =. 2009 , doi =

2009
[221]

Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm , volume =

Charles Audet and John E. Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm , volume =. 2008 , doi =

2008
[222]

Globalization Strategies for Mesh Adaptive Direct Search , volume =

Charles Audet and John E. Globalization Strategies for Mesh Adaptive Direct Search , volume =. 2010 , doi =

2010
[223]

Trade-off studies in blackbox optimization , volume =

Charles Audet and John E. Trade-off studies in blackbox optimization , volume =. 2012 , doi =

2012
[224]

A Surrogate-Model-Based Method for Constrained Optimization , booktitle =

Audet, Charles and John E. A Surrogate-Model-Based Method for Constrained Optimization , booktitle =. 2000 , doi =

2000
[225]

Audet and M

C. Audet and M. Kokkolaras , title =. 2016 , doi =

2016
[226]

Order-based error for managing ensembles of surrogates in mesh adaptive direct search , volume =

Charles Audet and Michael Kokkolaras and S. Order-based error for managing ensembles of surrogates in mesh adaptive direct search , volume =. 2018 , doi =

2018
[227]

2006 , doi =

Charles Audet and Dominique Orban , title =. 2006 , doi =

2006
[228]

2008 , doi =

Audet, Charles and Savard, Gilles and Zghal, Walid , title =. 2008 , doi =

2008
[229]

2010 , doi =

Audet, Charles and Savard, Gilles and Zghal, Walid , title =. 2010 , doi =

2010
[230]

Journal of Machine Learning Research , url =

Auer, Peter , title =. Journal of Machine Learning Research , url =. 2002 , gurl =

2002
[231]

Finite-time Analysis of the Multiarmed Bandit Problem , volume =

Auer, Peter and Cesa-Bianchi, Nicol\`. Finite-time Analysis of the Multiarmed Bandit Problem , volume =. 2002 , doi =

2002
[232]

The Nonstochastic Multiarmed Bandit Problem , volume =

Auer, Peter and Cesa-Bianchi, Nicol\`. The Nonstochastic Multiarmed Bandit Problem , volume =. 2003 , doi =

2003
[233]

Auger , title =

A. Auger , title =. 2005 , doi =

2005
[234]

Auger and N

A. Auger and N. Hansen and J. Experimental Comparisons of Derivative Free Optimization Algorithms , booktitle =. 2009 , doi =

2009
[235]

and Marzouk, Y

Augustin, F. and Marzouk, Y. M. , title =. 2014 , gurl =

2014
[236]

2017 , url =

Vernon Austel and Sanjeeb Dash and Oktay Gunluk and Lior Horesh and Leo Liberti and Giacomo Nannicini and Baruch Schieber , title =. 2017 , url =

2017
[237]

Wild , title =

Anthony Austin and Zichao Wendy Di and Sven Leyffer and Stefan M. Wild , title =. 2019 , doi =

2019
[238]

Kolda , title =

Woody Austin and Grey Ballard and Tamara G. Kolda , title =. International Parallel and Distributed Processing Symposium (. 2016 , doi =

2016
[239]

Avelino and Javier M

Catarina P. Avelino and Javier M. Moguerza and Alberto Olivares and Francisco J. Prieto , title =. 2009 , doi =

2009
[240]

2008 , doi =

Igor Averbakh and Yun-Bin Zhao , title =. 2008 , doi =

2008
[241]

Optimization Model Problems , Author =
[242]

Discrete

David Avis and Komei Fukuda , title =. Discrete. doi:10.1007/bf02293050 , year =

doi
[243]

Avriel, Mordecai and Wilde, D. J. , title =. 1967 , doi =

1967
[244]

N. S. Aybat and G. Iyengar , title =. 2014 , doi =

2014
[245]

ACM SIGARCH Computer Architecture News , volume =

Azizi, Omid and Mahesri, Aqeel and Lee, Benjamin C and Patel, Sanjay J and Horowitz, Mark , title =. ACM SIGARCH Computer Architecture News , volume =
[246]

1981 , doi =

Norio Baba , title =. 1981 , doi =

1981
[247]

1977 , doi =

Norio Baba and Toshio Shoman and Yoshikazu Sawaragi , title =. 1977 , doi =

1977
[248]

2009 , doi =

Baboulin, Marc and Buttari, Alfredo and Dongarra, Jack and Kurzak, Jakub and Langou, Julie and Langou, Julien and Luszczek, Piotr and Tomov, Stanimire , title =. 2009 , doi =

2009
[249]

2022 , eprint=

Information Theory with Kernel Methods , author=. 2022 , eprint=

2022
[250]

29th Annual Conference on Learning Theory , editor =

Francis Bach and Vianney Perchet , title =. 29th Annual Conference on Learning Theory , editor =. 2016 , gurl =

2016
[251]

Bachoc and C

F. Bachoc and C. Helbert and V. Picheny , title =. 2019 , url =

2019
[252]

, year =

B\"ack, T. , year =. Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms , doi =
[253]

1994 , doi =

Bacon, David F and Graham, Susan L and Sharp, Oliver J , title =. 1994 , doi =

1994
[254]

, isbn =

Bader, Johannes M. , isbn =. Hypervolume-Based Search for Multiobjective Optimization: Theory and Methods , publisher =. 2010 , location =

2010
[255]

2009 IEEE Nuclear Science Symposium Conference Record (NSS/MIC) , pages =

Baer, Matthias and Maa. 2009 IEEE Nuclear Science Symposium Conference Record (NSS/MIC) , pages =

2009
[256]

A Direct Search Algorithm for Global Optimization , volume =

Enrique Baeyens and Alberto Herreros and Jos. A Direct Search Algorithm for Global Optimization , volume =. 2016 , doi =

2016
[257]

Bagirov and Asef Nazari Ganjehlou , title =

Adil M. Bagirov and Asef Nazari Ganjehlou , title =. 2008 , doi =

2008
[258]

A. M. Bagirov and L. Jin and N. Karmitsa and A. Al Nuaimat and N. Sultanova , title =. 2013 , doi =

2013
[259]

A. M. Bagirov and B. Karas\". Discrete Gradient Method: Derivative-Free Method for Nonsmooth Optimization , volume =. 2007 , doi =

2007
[260]

Bagirov and Julien Ugon , title =

Adil M. Bagirov and Julien Ugon , title =. 2006 , doi =

2006
[261]

Performance Tuning of Scientific Applications , publisher =

David Bailey and Robert Lucas and Samuel Williams , year =. Performance Tuning of Scientific Applications , publisher =
[262]

Euro-Par 2005 Parallel Processing , publisher =

Bailey, David and Snavely, Allan , title =. Euro-Par 2005 Parallel Processing , publisher =

2005
[263]

D. H. Bailey and E. Barszcz and J. T. Barton and D. S. Browning and R. L. Carter and L. Dagum and R. A. Fatoohi and P. O. Frederickson and T. A. Lasinski and R. S. Schreiber and H. D. Simon and V. Venkatakrishnan and S. K. Weeratunga , title =. 1991 , doi =

1991
[264]

Iyer and M

Ishan Bajaj and Shachit S. Iyer and M. M. Faruque Hasan , title =. 2018 , doi =

2018
[265]

VECPAR'2002, Fifth International Conference on High Performance Computing for Computational Science: Selected Papers and Invited Talks , publisher =

Baker, A and Dennis, J M and Jessup, E R , title =. VECPAR'2002, Fifth International Conference on High Performance Computing for Computational Science: Selected Papers and Invited Talks , publisher =

2002
[266]

2003 , school =

Baker, A H , title =. 2003 , school =

2003
[267]

2006 , doi =

Baker, A H and Dennis, J M and Jessup, E R , title =. 2006 , doi =

2006
[268]

2005 , doi =

Baker, A H and Jessup, E R and Manteuffel, T , title =. 2005 , doi =

2005
[269]

Gramacy and Radu Herbei and David Higdon and Jiangeng Huang and Leah R

Evan Baker and Pierre Barbillon and Arindam Fadikar and Robert B. Gramacy and Radu Herbei and David Higdon and Jiangeng Huang and Leah R. Johnson and Pulong Ma and Anirban Mondal and Bianica Pires and Jerome Sacks and Vadim Sokolov , title =. 2020 , number =

2020
[270]

Wild and Karen Willcox , title =

Nathan Baker and Frank Alexander and Timo Bremer and Aric Hagberg and Yannis Kevrekidis and Habib Najm and Manish Parashar and Abani Patra and James Sethian and Stefan M. Wild and Karen Willcox , title =. 2019 , doi =

2019
[271]

Wild and Fangfang Xia and Tom Brettin and Rick Stevens , title =

Prasanna Balaprakash and Romain Egele and Misha Salim and Venkatram Vishwanath and Stefan M. Wild and Fangfang Xia and Tom Brettin and Rick Stevens , title =. International Conference for High Performance Computing, Networking, Storage, and Analysis (SC19) , publisher =. 2019 , doi =

2019
[272]

Analysis of the Tradeoffs between Energy and Run Time for Multilevel Checkpointing , booktitle =

Prasanna Balaprakash and Leonardo A. Analysis of the Tradeoffs between Energy and Run Time for Multilevel Checkpointing , booktitle =. 2015 , doi =

2015
[273]

Gramacy and Stefan M

Prasanna Balaprakash and Robert B. Gramacy and Stefan M. Wild , title =. Proceedings of IEEE International Conference on Cluster Computing (CLUSTER 2013) , pages =. 2013 , doi =

2013
[274]

Wild and Hal Finkel and Venkatram Vishwanath and Kalyan Kumaran , title =

Prasanna Balaprakash and Vitali Morozov and Stefan M. Wild and Hal Finkel and Venkatram Vishwanath and Kalyan Kumaran , title =
[275]

Gramacy and Paul D

Prasanna Balaprakash and Karl Rupp and Azamat Mametjanov and Robert B. Gramacy and Paul D. Hovland and Stefan M. Wild , title =. Parallel Computing: Accelerating Computational Science and Engineering (ParCo2013) , publisher =. 2014 , doi =

2014
[276]

Uram and Venkat Vishwanath and Stefan M

Prasanna Balaprakash and Michael Salim and Thomas D. Uram and Venkat Vishwanath and Stefan M. Wild , title =. 25th IEEE International Conference on High Performance Computing (HiPC18) , anumber =. 2018 , doi =

2018
[277]

Wild , title =

Prasanna Balaprakash and Ananta Tiwari and Stefan M. Wild , title =. International Conference for High Performance Computing, Networking, Storage, and Analysis (SC13) , year =
[278]

Wild , title =

Prasanna Balaprakash and Ananta Tiwari and Stefan M. Wild , title =. High Performance Computing Systems. Performance Modeling, Benchmarking and Simulation , editor =. 2014 , doi =

2014
[279]

Wild and Laura Carrington and Paul D

Prasanna Balaprakash and Ananta Tiwari and Stefan M. Wild and Laura Carrington and Paul D. Hovland , title =. High Performance Computing: 31st International Conference, ISC High Performance 2016, Frankfurt, Germany, June 19-23, 2016, Proceedings , editor =. 2016 , doi =

2016
[280]

Wild and Paul D

Prasanna Balaprakash and Stefan M. Wild and Paul D. Hovland , title =. 2011 , doi =

2011
[281]

Wild and Paul D

Prasanna Balaprakash and Stefan M. Wild and Paul D. Hovland , title =. 2013 , url =

2013
[282]

Wild and Paul D

Prasanna Balaprakash and Stefan M. Wild and Paul D. Hovland , title =. High Performance Computing for Computational Science - VECPAR 2012, 10th International Conference, Kobe, Japan, July 17-20, 2012, Revised Selected Papers , publisher =. 2013 , doi =

2012
[283]

Wild and Boyana Norris , title =

Prasanna Balaprakash and Stefan M. Wild and Boyana Norris , title =. 2012 , doi =

2012
[284]

Advances in Neural Information Processing Systems 31 , publisher =

Balasubramanian, Krishnakumar and Ghadimi, Saeed , title =. Advances in Neural Information Processing Systems 31 , publisher =. 2018 , gurl =

2018
[285]

Foundations of Computational Mathematics , volume =

Krishnakumar Balasubramanian and Saeed Ghadimi , title =. Foundations of Computational Mathematics , volume =. doi:10.1007/s10208-021-09499-8 , year =

doi
[286]

Adams and Jed Brown and Peter Brune and Kris Buschelman and Lisandro Dalcin and Alp Dener and Victor Eijkhout and William D

Satish Balay and Shrirang Abhyankar and Mark F. Adams and Jed Brown and Peter Brune and Kris Buschelman and Lisandro Dalcin and Alp Dener and Victor Eijkhout and William D. Gropp and Dmitry Karpeyev and Dinesh Kaushik and Matthew G. Knepley and Dave A. May and Lois Curfman McI...
[287]

Adams and Jed Brown and Peter Brune and Kris Buschelman and Lisandro Dalcin and Victor Eijkhout and William D

Satish Balay and Shrirang Abhyankar and Mark F. Adams and Jed Brown and Peter Brune and Kris Buschelman and Lisandro Dalcin and Victor Eijkhout and William D. Gropp and Dinesh Kaushik and Matthew G. Knepley and Lois Curfman McInnes and Karl Rupp and Barry F. Smith and Stefano ...

2016
[288]

Adams and Jed Brown and Peter Brune and Kris Buschelman and Victor Eijkhout and William D

Satish Balay and Mark F. Adams and Jed Brown and Peter Brune and Kris Buschelman and Victor Eijkhout and William D. Gropp and Dinesh Kaushik and Matthew G. Knepley and Lois Curfman McInnes and Karl Rupp and Barry F. Smith and Hong Zhang , title =. 2013 , url =

2013
[289]

Satish Balay and Shrirang Abhyankar and Mark F. Adams and Steven Benson and Jed Brown and Peter Brune and Kris Buschelman and Emil Constantinescu and Lisandro Dalcin and Alp Dener and Victor Eijkhout and Jacob Faibussowitsch and William D. Gropp and V\'. doi:10.2172/2205494 , year =

doi
[290]

Gropp and Lois Curfman McInnes and Barry F

Satish Balay and William D. Gropp and Lois Curfman McInnes and Barry F. Smith , title =. Modern Software Tools in Scientific Computing , editor =. 1997 , doi =

1997
[291]

Autoencoders, Unsupervised Learning, and Deep Architectures , year =

Baldi, Pierre , booktitle =. Autoencoders, Unsupervised Learning, and Deep Architectures , year =
[292]

M. L. Balinski , title =. doi:10.1137/0109008 , year =

doi
[293]

doi:10.1103/prxquantum.2.040321 , year =

Leonardo Banchi and Jason Pereira and Stefano Pirandola , title =. doi:10.1103/prxquantum.2.040321 , year =

doi
[294]

A. S. Bandeira and Katya Scheinberg and Lu\'is N. Vicente , title =. 2012 , doi =

2012
[295]

A. S. Bandeira and Katya Scheinberg and Lu\'is N. Vicente , title =. 2014 , doi =

2014
[296]

2012 , doi =

Chaithanya Bandi and Dimitris Bertsimas , title =. 2012 , doi =

2012
[297]

, title =

Banerjee, Sudipto and Gelfand, Alan E. , title =. 2002 , journal =

2002
[298]

and Carlin, Bradley P

Banerjee, Sudipto and Gelfand, Alan E. and Carlin, Bradley P. , year =. Hierarchical Modeling and Analysis for Spatial Data , publisher =. doi:10.1201/b17115 , location =

doi
[299]

N. V. Banichuk and V. M. Petrov and F. L. Chernous'ko , title =. 1966 , doi =

1966
[300]

N. V. Banitchuk and V. M. Petrov and F. L. Chernousko , title =. 1966 , journal =

1966

Pith tools

Reviewed August 2, 2026 · model on record in the stance chip above.

[1] [1]

2025 , eprint=

Privacy-Preserving Black-Box Optimization (PBBO): Theory and the Model-Based Algorithm DFOp , author=. 2025 , eprint=

2025

[2] [2]

Wild , year=

Pengcheng Xie and Stefan M. Wild , year=. 2504.03606 , archivePrefix=

arXiv

[3] [3]

2025 , eprint=

A novel numerical method tailored for unconstrained optimization problems , author=. 2025 , eprint=

2025

[4] [4]

IMA Journal of Numerical Analysis , volume =

Xie, Pengcheng and Yuan, Yaxiang , title =. IMA Journal of Numerical Analysis , volume =. 2026 , month =. doi:10.1093/imanum/drae106 , url =

doi:10.1093/imanum/drae106 2026

[5] [5]

2025 , journal=

A spectral Levenberg-Marquardt-Deflation method for multiple solutions of semilinear elliptic systems , author=. 2025 , journal=

2025

[6] [6]

2025 , url=

An Improved Adaptive Orthogonal Basis Deflation Method for Multiple Solutions with Applications to Nonlinear Elliptic Equations in Varying Domains , author=. 2025 , url=

2025

[7] [7]

2025 , eprint=

Objective Value Change and Shape-Based Accelerated Optimization for the Neural Network Approximation , author=. 2025 , eprint=

2025

[8] [8]

Wild , title =

Pengcheng Xie and Stefan M. Wild , title =. 2024 , journal =

2024