Cited in
(75)- Space-filling orthogonal arrays of strength two
- Bifidelity Surrogate Modelling: Showcasing the Need for New Test Instances
- Gradient-based optimization for regression in the functional tensor-train format
- Bayesian optimization with output-weighted optimal sampling
- Adaptive Design and Analysis Via Partitioning Trees for Emulation of a Complex Computer Code
- Explicit Families of Functions on the Sphere with Exactly Known Sobolev Space Smoothness
- Hydrological cycle algorithm for continuous optimization problems
- Gauss-Christoffel quadrature for inverse regression: applications to computer experiments
- Scaled Vecchia approximation for fast computer-model emulation
- Mini-minimax uncertainty quantification for emulators
- Jointly robust prior for Gaussian stochastic process in emulation, calibration and variable selection
- Prediction of non-stationary response functions using a Bayesian composite Gaussian process
- Manifold learning for efficient gravitational search algorithm
- High-dimensional black-box optimization under uncertainty
- Multifidelity information fusion algorithms for high-dimensional systems and massive data sets
- Comment: unreasonable effectiveness of Monte Carlo
- Output Space Entropy Search Framework for Multi-Objective Bayesian Optimization
- scientific article; zbMATH DE number 7415092 (Why is no real title available?)
- Bound-constrained global optimization of functions with low effective dimensionality using multiple random embeddings
- Batch sequential adaptive designs for global optimization
- Generalized continuation Newton methods and the trust-region updating strategy for the underdetermined system
- DIRECTLib
- Explicit pseudo-transient continuation and the trust-region updating strategy for unconstrained optimization
- Robust Gaussian stochastic process emulation
- Hopping between distant basins
- A forward-backward greedy approach for sparse multiscale learning
- Comparison of Gaussian process modeling software
- Generalized hierarchical expected improvement method based on black-box functions of adaptive search strategy
- Super-polynomial accuracy of one dimensional randomized nets using the median of means
- Performance of convex underestimators in a branch-and-bound framework
- SPACE
- HYSDEL
- VTDIRECT95
- laGP
- EGO
- DiceKriging
- DiceOptim
- SURROGATES
- randtoolbox
- mlegp
- SQOPT
- tgp
- Global Optimization Test
- MrDIRECT
- ooDACE
- TESTPACK
- Rodinia
- FNN
- MaxPro
- MatWeb
- Neural parametric Fokker-Planck equation
- DiceEval
- AMPGO
- MVF
- RobustCalibration
- rPref
- lineqGPR
- GpGp
- CGP
- MUESLI
- IPscatt
- UniDOE
- Magic Point Shop
- QMC4PDE
- A comparative study on surrogate models for SAEAs
- foba
- apricot
- GPflux
- Reprint of: A forward-backward greedy approach for sparse multiscale learning
- A Lipschitz Matrix for Parameter Reduction in Computational Science
- Rapid Discrete Optimization via Simulation with Gaussian Markov Random Fields
- Nonlinear information fusion algorithms for data-efficient multi-fidelity modelling
- Emulating satellite drag from large simulation experiments
- \texttt{CAMERA}: a method for cost-aware, adaptive, multifidelity, efficient reliability analysis
- On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic
This page was built for software: Virtual library
