A Taxonomy of Constraints in Simulation-Based Optimization
arXiv:1505.07881
Abstract
The types of constraints encountered in black-box and simulation-based optimization problems differ significantly from those treated in nonlinear programming. We introduce a characterization of constraints to address this situation. We provide formal definitions for several constraint classes and present illustrative examples in the context of the resulting taxonomy. This taxonomy, denoted QRAK, is useful for modeling and problem formulation, as well as optimization software development and deployment. It can also be used as the basis for a dialog with practitioners in moving problems to increasingly solvable branches of optimization.
Cited by in corpus (8)
- A Covariance Matrix Self-Adaptation Evolution Strategy for Optimization under Linear Constraints
- Generative Models for Anomaly Detection and Design-Space Dimensionality Reduction in Shape Optimization
- Quantifying uncertainty with ensembles of surrogates for blackbox optimization
- Adaptive Ranking Based Constraint Handling for Explicitly Constrained Black-Box Optimization
- An interior point method for nonlinear constrained derivative-free optimization
- Generalized Early Stopping in Evolutionary Direct Policy Search
- Constrained Optimization for Hybrid System Falsification and Application to Conjunctive Synthesis
- Towards a Systematic Development Process of Optimization Methods