Blackbox and derivative-free optimization: theory, algorithms and applications

DOI10.1007/s11081-016-9307-4zbMath1364.90008OpenAlexW2305977224WikidataQ61160683 ScholiaQ61160683MaRDI QIDQ2357954

Michael Kokkolaras, Charles Audet

Publication date: 20 June 2017

Published in: Optimization and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11081-016-9307-4

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)

Related Items (8)

Ensemble Gradient for Learning Turbulence Models from Indirect Observations ⋮ Bayesian optimization for the spanwise oscillation of a gliding flat plate ⋮ A local search method for costly black-box problems and its application to CSP plant start-up optimization refinement ⋮ The optimal upper bound of the number of queries for Laplace mechanism under differential privacy ⋮ Unified approach for solving box-constrained models with continuous or discrete variables by non monotone direct search methods ⋮ Surrogate optimization of deep neural networks for groundwater predictions ⋮ Book review of: C. Audet and W. Hare, Derivative-free and blackbox optimization ⋮ Local search with groups of step sizes

This page was built for publication: Blackbox and derivative-free optimization: theory, algorithms and applications