Monotonic grey box direct search optimization
From MaRDI portal
Publication:2300634
Recommendations
- A new approach to optimization under monotonic constraint
- Binary, unrelaxable and hidden constraints in blackbox optimization
- An alogrithm for monotonic global optimization problems∗
- Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization
- The mesh adaptive direct search algorithm for periodic variables
Cites work
- A progressive barrier for derivative-free nonlinear programming
- A variance-based method to rank input variables of the mesh adaptive direct search algorithm
- Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm
- An alogrithm for monotonic global optimization problems∗
- Analysis of Generalized Pattern Searches
- ARGONAUT: algorithms for global optimization of constrained grey-box computational problems
- Benchmarking Derivative-Free Optimization Algorithms
- Cone monotonicity: structure theorem, properties, and comparisons to other notions of monotonicity
- Derivative-free and blackbox optimization
- Differentiability of cone-monotone functions on separable Banach space
- Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm
- Efficient use of parallelism in algorithmic parameter optimization applications
- Manifold sampling for _1 nonconvex optimization
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Mesh adaptive direct search algorithms for mixed variable optimization
- Optimizing damper connectors for adjacent buildings
- Robust optimization of noisy blackbox problems using the mesh adaptive direct search algorithm
- Test examples for nonlinear programming codes
- The mesh adaptive direct search algorithm for granular and discrete variables
Cited in
(2)
This page was built for publication: Monotonic grey box direct search optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2300634)