Derivative-Free and Blackbox Optimization

From MaRDI portal
Publication:4588519

DOI10.1007/978-3-319-68913-5zbMath1391.90001OpenAlexW2775085189MaRDI QIDQ4588519

Charles Audet, Warren L. Hare

Publication date: 26 October 2017

Published in: Springer Series in Operations Research and Financial Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-68913-5



Related Items

A derivative-free optimization algorithm combining line-search and trust-region techniques, Numerical methods using two different approximations of space-filling curves for black-box global optimization, Use of static surrogates in hyperparameter optimization, Gradient and diagonal Hessian approximations using quadratic interpolation models and aligned regular bases, On the numerical performance of finite-difference-based methods for derivative-free optimization, Full-low evaluation methods for derivative-free optimization, A progressive barrier derivative-free trust-region algorithm for constrained optimization, Mesh-based Nelder-Mead algorithm for inequality constrained optimization, A discussion on variational analysis in derivative-free optimization, Model-Based Derivative-Free Methods for Convex-Constrained Optimization, Stochastic zeroth-order discretizations of Langevin diffusions for Bayesian inference, Derivative-free methods for mixed-integer nonsmooth constrained optimization, Using first-order information in direct multisearch for multiobjective optimization, Multi-fidelity algorithms for the horizontal alignment problem in road design, Efficient unconstrained black box optimization, Bi-objective optimization for road vertical alignment design, Zeroth-order algorithms for stochastic distributed nonconvex optimization, Exploiting Problem Structure in Derivative Free Optimization, Quantifying uncertainty with ensembles of surrogates for blackbox optimization, An adaptive direct multisearch method for black-box multi-objective optimization, Team Orienteering with Time-Varying Profit, On black-box optimization in divide-and-conquer SAT solving, Escaping local minima with local derivative-free methods: a numerical investigation, Convergence of the Nelder-Mead method, Escaping Unknown Discontinuous Regions in Blackbox Optimization, On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems, Direct search based on probabilistic feasible descent for bound and linearly constrained problems, Efficient calculation of regular simplex gradients, Detecting negative eigenvalues of exact and approximate Hessian matrices in optimization, Non-smooth setting of stochastic decentralized convex optimization problem over time-varying graphs, Zeroth-order algorithms for nonconvex-strongly-concave minimax problems with improved complexities, A simulation-based optimization approach for the calibration of a discrete event simulation model of an emergency department, Direct Search Based on Probabilistic Descent in Reduced Spaces, Rotorcraft low-noise trajectories design: black-box optimization using surrogates, Hermite least squares optimization: a modification of BOBYQA for optimization with limited derivative information, Applying the pattern search implicit filtering algorithm for solving a noisy problem of parameter identification, TREGO: a trust-region framework for efficient global optimization, Resource allocation problems with expensive function evaluations, The Modified-Half-Normal distribution: Properties and an efficient sampling scheme, A deterministic algorithm to compute the cosine measure of a finite positive spanning set, Uniform simplex of an arbitrary orientation, A merit function approach for evolution strategies, Two decades of blackbox optimization applications, A finite-source inventory system with service facility and postponed demands, Analysis and optimization of hybrid replenishment policy in a double-sources queueing-inventory system with MAP arrivals, Derivative-free mixed binary necklace optimization for cyclic-symmetry optimal design problems, A general mathematical framework for constrained mixed-variable blackbox optimization problems with meta and categorical variables, Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates, Nicely structured positive bases with maximal cosine measure, \texttt{GLISp-r}: a preference-based optimization algorithm with convergence guarantees, Limiting behaviour of the generalized simplex gradient as the number of points tends to infinity on a fixed shape in \(\mathrm{IR}^n\), Derivative-free optimization of a rapid-cycling synchrotron, Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization, Practical initialization of the Nelder-Mead method for computationally expensive optimization problems, Worst-case evaluation complexity of a derivative-free quadratic regularization method, A derivative-free 𝒱𝒰-algorithm for convex finite-max problems, Parallel strategies for direct multisearch, A local search method for costly black-box problems and its application to CSP plant start-up optimization refinement, An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables, Limiting behavior of derivative approximation techniques as the number of points tends to infinity on a fixed interval in \(\mathbb{R}\), The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables, Biobjective Simulation Optimization on Integer Lattices Using the Epsilon-Constraint Method in a Retrospective Approximation Framework, Combining cross-entropy and MADS methods for inequality constrained global optimization, Black-Box Optimization: Methods and Applications, Finding Effective SAT Partitionings Via Black-Box Optimization, A derivative-free optimization algorithm for the efficient minimization of functions obtained via statistical averaging, DEFT-FUNNEL: an open-source global optimization solver for constrained grey-box and black-box problems, Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions, Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm, Modeling past-dependent partial repairs for condition-based maintenance of continuously deteriorating systems, On the use of polynomial models in multiobjective directional direct search, Worst-case complexity bounds of directional direct-search methods for multiobjective optimization, Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates, Generating set search using simplex gradients for bound-constrained black-box optimization, On the properties of the cosine measure and the uniform angle subspace, Inexact derivative-free optimization for bilevel learning, Improving the Flexibility and Robustness of Model-based Derivative-free Optimization Solvers, DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization, A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints, A method for convex black-box integer global optimization, Surrogate optimization of deep neural networks for groundwater predictions, Derivative-free superiorization: principle and algorithm, Monotonic grey box direct search optimization, A derivative-free algorithm for spherically constrained optimization, Derivative-free optimization methods, GOPS: efficient RBF surrogate global optimization algorithm with high dimensions and many parallel processors including application to multimodal water quality PDE model calibration, Expected complexity analysis of stochastic direct-search, Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization, A Derivative-Free Method for Structured Optimization Problems, Gradient-free aerodynamic shape optimization using Large Eddy Simulation, A derivative-free trust-region algorithm with copula-based models for probability maximization problems, Hierarchically constrained blackbox optimization, Positive bases with maximal cosine measure, Dynamic improvements of static surrogates in direct search optimization, Approximating the diagonal of a Hessian: which sample set of points should be used, A geometric integration approach to nonsmooth, nonconvex optimisation, Calculus Identities for Generalized Simplex Gradients: Rules and Applications, COCO: a platform for comparing continuous optimizers in a black-box setting, High-fidelity gradient-free optimization of low-pressure turbine cascades, Optimization of Stochastic Blackboxes with Adaptive Precision, Review and comparison of algorithms and software for mixed-integer derivative-free optimization