Pages that link to "Item:Q4588519"
From MaRDI portal
The following pages link to Derivative-Free and Blackbox Optimization (Q4588519):
Displaying 50 items.
- Gradient and diagonal Hessian approximations using quadratic interpolation models and aligned regular bases (Q820723) (← links)
- A discussion on variational analysis in derivative-free optimization (Q829491) (← links)
- A progressive barrier derivative-free trust-region algorithm for constrained optimization (Q1616931) (← links)
- Mesh-based Nelder-Mead algorithm for inequality constrained optimization (Q1616932) (← links)
- Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm (Q1754299) (← links)
- Combining cross-entropy and MADS methods for inequality constrained global optimization (Q1981930) (← links)
- A derivative-free optimization algorithm for the efficient minimization of functions obtained via statistical averaging (Q1986101) (← links)
- On the use of polynomial models in multiobjective directional direct search (Q2023694) (← links)
- Worst-case complexity bounds of directional direct-search methods for multiobjective optimization (Q2026717) (← links)
- Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates (Q2028452) (← links)
- Generating set search using simplex gradients for bound-constrained black-box optimization (Q2028453) (← links)
- On the properties of the cosine measure and the uniform angle subspace (Q2028479) (← links)
- Inexact derivative-free optimization for bilevel learning (Q2036198) (← links)
- DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization (Q2044473) (← links)
- A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints (Q2044568) (← links)
- A method for convex black-box integer global optimization (Q2045020) (← links)
- Surrogate optimization of deep neural networks for groundwater predictions (Q2046338) (← links)
- Derivative-free superiorization: principle and algorithm (Q2048824) (← links)
- GOPS: efficient RBF surrogate global optimization algorithm with high dimensions and many parallel processors including application to multimodal water quality PDE model calibration (Q2069161) (← links)
- Expected complexity analysis of stochastic direct-search (Q2070336) (← links)
- Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization (Q2070360) (← links)
- Gradient-free aerodynamic shape optimization using Large Eddy Simulation (Q2072308) (← links)
- A derivative-free trust-region algorithm with copula-based models for probability maximization problems (Q2076911) (← links)
- Hierarchically constrained blackbox optimization (Q2083999) (← links)
- Approximating the diagonal of a Hessian: which sample set of points should be used (Q2084264) (← links)
- A geometric integration approach to nonsmooth, nonconvex optimisation (Q2088134) (← links)
- High-fidelity gradient-free optimization of low-pressure turbine cascades (Q2102011) (← links)
- Review and comparison of algorithms and software for mixed-integer derivative-free optimization (Q2114591) (← links)
- Use of static surrogates in hyperparameter optimization (Q2120124) (← links)
- Stochastic zeroth-order discretizations of Langevin diffusions for Bayesian inference (Q2137043) (← links)
- Derivative-free methods for mixed-integer nonsmooth constrained optimization (Q2141352) (← links)
- Efficient unconstrained black box optimization (Q2146451) (← links)
- Bi-objective optimization for road vertical alignment design (Q2147028) (← links)
- Zeroth-order algorithms for stochastic distributed nonconvex optimization (Q2151863) (← links)
- Quantifying uncertainty with ensembles of surrogates for blackbox optimization (Q2162525) (← links)
- An adaptive direct multisearch method for black-box multi-objective optimization (Q2168631) (← links)
- Applying the pattern search implicit filtering algorithm for solving a noisy problem of parameter identification (Q2191793) (← links)
- A deterministic algorithm to compute the cosine measure of a finite positive spanning set (Q2192976) (← links)
- Uniform simplex of an arbitrary orientation (Q2192988) (← links)
- A local search method for costly black-box problems and its application to CSP plant start-up optimization refinement (Q2218908) (← links)
- An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables (Q2220918) (← links)
- Limiting behavior of derivative approximation techniques as the number of points tends to infinity on a fixed interval in \(\mathbb{R}\) (Q2222168) (← links)
- DEFT-FUNNEL: an open-source global optimization solver for constrained grey-box and black-box problems (Q2245001) (← links)
- Modeling past-dependent partial repairs for condition-based maintenance of continuously deteriorating systems (Q2272310) (← links)
- Monotonic grey box direct search optimization (Q2300634) (← links)
- A derivative-free algorithm for spherically constrained optimization (Q2307754) (← links)
- Positive bases with maximal cosine measure (Q2329658) (← links)
- Dynamic improvements of static surrogates in direct search optimization (Q2329664) (← links)
- Direct search based on probabilistic feasible descent for bound and linearly constrained problems (Q2419520) (← links)
- Efficient calculation of regular simplex gradients (Q2419521) (← links)
