Pages that link to "Item:Q4588519"
From MaRDI portal
The following pages link to Derivative-Free and Blackbox Optimization (Q4588519):
Displaying 50 items.
- Convergence of the Nelder-Mead method (Q2672718) (← links)
- On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems (Q2674587) (← links)
- A simulation-based optimization approach for the calibration of a discrete event simulation model of an emergency department (Q2678617) (← links)
- A general mathematical framework for constrained mixed-variable blackbox optimization problems with meta and categorical variables (Q2686978) (← links)
- Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates (Q2687061) (← links)
- Limiting behaviour of the generalized simplex gradient as the number of points tends to infinity on a fixed shape in \(\mathrm{IR}^n\) (Q2687735) (← links)
- Practical initialization of the Nelder-Mead method for computationally expensive optimization problems (Q2688914) (← links)
- Parallel strategies for direct multisearch (Q2699998) (← links)
- The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables (Q4634101) (← links)
- Improving the Flexibility and Robustness of Model-based Derivative-free Optimization Solvers (Q4960952) (← links)
- A Derivative-Free Method for Structured Optimization Problems (Q4987276) (← links)
- Optimization of Stochastic Blackboxes with Adaptive Precision (Q5020850) (← links)
- Model-Based Derivative-Free Methods for Convex-Constrained Optimization (Q5043286) (← links)
- Using first-order information in direct multisearch for multiobjective optimization (Q5058408) (← links)
- Multi-fidelity algorithms for the horizontal alignment problem in road design (Q5059454) (← links)
- Exploiting Problem Structure in Derivative Free Optimization (Q5066599) (← links)
- Team Orienteering with Time-Varying Profit (Q5084650) (← links)
- On black-box optimization in divide-and-conquer SAT solving (Q5085259) (← links)
- Escaping local minima with local derivative-free methods: a numerical investigation (Q5093686) (← links)
- Escaping Unknown Discontinuous Regions in Blackbox Optimization (Q5097015) (← links)
- A derivative-free 𝒱𝒰-algorithm for convex finite-max problems (Q5113714) (← links)
- Biobjective Simulation Optimization on Integer Lattices Using the Epsilon-Constraint Method in a Retrospective Approximation Framework (Q5148193) (← links)
- Black-Box Optimization: Methods and Applications (Q5153493) (← links)
- Finding Effective SAT Partitionings Via Black-Box Optimization (Q5153508) (← links)
- Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions (Q5162654) (← links)
- Derivative-free optimization methods (Q5230522) (← links)
- Calculus Identities for Generalized Simplex Gradients: Rules and Applications (Q5853722) (← links)
- COCO: a platform for comparing continuous optimizers in a black-box setting (Q5859012) (← links)
- On the numerical performance of finite-difference-based methods for derivative-free optimization (Q5882235) (← links)
- Full-low evaluation methods for derivative-free optimization (Q5882241) (← links)
- Detecting negative eigenvalues of exact and approximate Hessian matrices in optimization (Q6057628) (← links)
- Non-smooth setting of stochastic decentralized convex optimization problem over time-varying graphs (Q6060563) (← links)
- Zeroth-order algorithms for nonconvex-strongly-concave minimax problems with improved complexities (Q6064044) (← links)
- Direct Search Based on Probabilistic Descent in Reduced Spaces (Q6071887) (← links)
- Rotorcraft low-noise trajectories design: black-box optimization using surrogates (Q6088531) (← links)
- Hermite least squares optimization: a modification of BOBYQA for optimization with limited derivative information (Q6088560) (← links)
- TREGO: a trust-region framework for efficient global optimization (Q6102171) (← links)
- Resource allocation problems with expensive function evaluations (Q6106771) (← links)
- A merit function approach for evolution strategies (Q6114898) (← links)
- Two decades of blackbox optimization applications (Q6114909) (← links)
- A finite-source inventory system with service facility and postponed demands (Q6148750) (← links)
- Analysis and optimization of hybrid replenishment policy in a double-sources queueing-inventory system with MAP arrivals (Q6148767) (← links)
- Derivative-free mixed binary necklace optimization for cyclic-symmetry optimal design problems (Q6159484) (← links)
- Nicely structured positive bases with maximal cosine measure (Q6164951) (← links)
- \texttt{GLISp-r}: a preference-based optimization algorithm with convergence guarantees (Q6166660) (← links)
- Derivative-free optimization of a rapid-cycling synchrotron (Q6173802) (← links)
- Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization (Q6175706) (← links)
- Worst-case evaluation complexity of a derivative-free quadratic regularization method (Q6181370) (← links)
- A derivative-free optimization algorithm combining line-search and trust-region techniques (Q6183896) (← links)
- Numerical methods using two different approximations of space-filling curves for black-box global optimization (Q6200380) (← links)
