The following pages link to Virtual library (Q39314):
Displaying 38 items.
- Comparison of Gaussian process modeling software (Q65764) (← links)
- Prediction of non-stationary response functions using a Bayesian composite Gaussian process (Q829711) (← links)
- Hydrological cycle algorithm for continuous optimization problems (Q1659261) (← links)
- Robust Gaussian stochastic process emulation (Q1991689) (← links)
- Explicit pseudo-transient continuation and the trust-region updating strategy for unconstrained optimization (Q2029126) (← links)
- On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic (Q2046307) (← links)
- Generalized continuation Newton methods and the trust-region updating strategy for the underdetermined system (Q2051064) (← links)
- Hopping between distant basins (Q2079697) (← links)
- A forward-backward greedy approach for sparse multiscale learning (Q2083098) (← links)
- Batch sequential adaptive designs for global optimization (Q2089024) (← links)
- \texttt{CAMERA}: a method for cost-aware, adaptive, multifidelity, efficient reliability analysis (Q2099759) (← links)
- Generalized hierarchical expected improvement method based on black-box functions of adaptive search strategy (Q2109428) (← links)
- Bayesian optimization with output-weighted optimal sampling (Q2123965) (← links)
- A comparative study on surrogate models for SAEAs (Q2228425) (← links)
- Gradient-based optimization for regression in the functional tensor-train format (Q2312177) (← links)
- Jointly robust prior for Gaussian stochastic process in emulation, calibration and variable selection (Q2316987) (← links)
- Comment: unreasonable effectiveness of Monte Carlo (Q2325607) (← links)
- Gauss-Christoffel quadrature for inverse regression: applications to computer experiments (Q2329776) (← links)
- Manifold learning for efficient gravitational search algorithm (Q2660931) (← links)
- High-dimensional black-box optimization under uncertainty (Q2669612) (← links)
- Reprint of: A forward-backward greedy approach for sparse multiscale learning (Q2679340) (← links)
- Bound-constrained global optimization of functions with low effective dimensionality using multiple random embeddings (Q2687068) (← links)
- Mini-Minimax Uncertainty Quantification for Emulators (Q2945172) (← links)
- Explicit Families of Functions on the Sphere with Exactly Known Sobolev Space Smoothness (Q4611799) (← links)
- Nonlinear information fusion algorithms for data-efficient multi-fidelity modelling (Q4647131) (← links)
- A Lipschitz Matrix for Parameter Reduction in Computational Science (Q4997385) (← links)
- Output Space Entropy Search Framework for Multi-Objective Bayesian Optimization (Q5026209) (← links)
- Adaptive Design and Analysis Via Partitioning Trees for Emulation of a Complex Computer Code (Q5057264) (← links)
- Super-polynomial accuracy of one dimensional randomized nets using the median of means (Q5058657) (← links)
- Bifidelity Surrogate Modelling: Showcasing the Need for New Test Instances (Q5060781) (← links)
- Rapid Discrete Optimization via Simulation with Gaussian Markov Random Fields (Q5085466) (← links)
- Neural Parametric Fokker--Planck Equation (Q5087103) (← links)
- Scaled Vecchia Approximation for Fast Computer-Model Emulation (Q5097836) (← links)
- (Q5159421) (← links)
- Space-filling orthogonal arrays of strength two (Q5220794) (← links)
- Emulating Satellite Drag from Large Simulation Experiments (Q5237174) (← links)
- Multifidelity Information Fusion Algorithms for High-Dimensional Systems and Massive Data sets (Q5739794) (← links)
- Performance of convex underestimators in a branch-and-bound framework (Q5963232) (← links)
