Monotonic grey box direct search optimization
From MaRDI portal
Publication:2300634
DOI10.1007/s11590-019-01497-8zbMath1433.90200OpenAlexW2987410708WikidataQ126863684 ScholiaQ126863684MaRDI QIDQ2300634
Christophe Tribes, Charles Audet, Catherine Poissant, Pascal Côté
Publication date: 27 February 2020
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-019-01497-8
Related Items
A discussion on variational analysis in derivative-free optimization, Two decades of blackbox optimization applications
Uses Software
Cites Work
- A variance-based method to rank input variables of the mesh adaptive direct search algorithm
- Mesh adaptive direct search algorithms for mixed variable optimization
- Test examples for nonlinear programming codes
- Robust optimization of noisy blackbox problems using the mesh adaptive direct search algorithm
- Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm
- Efficient use of parallelism in algorithmic parameter optimization applications
- Cone monotonicity: structure theorem, properties, and comparisons to other notions of monotonicity
- Optimizing damper connectors for adjacent buildings
- ARGONAUT: algorithms for global optimization of constrained grey-box computational problems
- An alogrithm for monotonic global optimization problems∗
- Algorithm 909
- Analysis of Generalized Pattern Searches
- Differentiability of cone-monotone functions on separable Banach space
- Derivative-Free and Blackbox Optimization
- The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables
- Benchmarking Derivative-Free Optimization Algorithms
- A Progressive Barrier for Derivative-Free Nonlinear Programming
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Manifold Sampling for $\ell_1$ Nonconvex Optimization
