Refine
Year of publication
Document Type
- Conference Proceeding (308) (remove)
Institute
- Forschungszentrum Mikrotechnik (134)
- Forschungszentrum Business Informatics (60)
- Technik | Engineering & Technology (60)
- Department of Computer Science (Ende 2021 aufgelöst; Integration in die übergeordnete OE Technik) (45)
- Wirtschaft (34)
- Forschungszentrum Energie (24)
- Forschungszentrum Human Centred Technologies (24)
- Didaktik (mit 31.03.2021 aufgelöst; Integration ins TELL Center) (15)
- Department of Engineering (Ende 2021 aufgelöst; Integration in die übergeordnete OE Technik) (12)
- Josef Ressel Zentrum für Materialbearbeitung (12)
Language
- English (308) (remove)
Keywords
- arrayed waveguide gratings (9)
- Y-branch splitter (6)
- integrated optics (6)
- photonics (6)
- MMI splitter (5)
- AWG design (4)
- insertion loss (4)
- Arrayed waveguide gratings (3)
- Artificial Intelligence (incl. Robotics) (3)
- Crosstalk (3)
Stress testing is part of today’s bank risk management and often required by the governing regulatory authority. Performing such a stress test with stress scenarios derived from a distribution, instead of pre-defined expert scenarios, results in a systematic approach in which new severe scenarios can be discovered. The required scenario distribution is obtained from historical time series via a Vector-Autoregressive time series model. The worst-case search, i.e. finding the scenario yielding the most severe situation for the bank, can be stated as an optimization problem. The problem itself is a constrained optimization problem in a high-dimensional search space. The constraints are the box constraints on the scenario variables and the plausibility of a scenario.
The latter is expressed by an elliptic constraint. As the evaluation of the stress scenarios is performed with a simulation tool, the optimization problem can be seen as black-box optimization problem. Evolution Strategy, a well-known optimizer for black-box problems, is applied here. The necessary adaptations to the algorithm are explained and a set of different algorithm design choices are investigated. It is shown that a simple box constraint handling method, i.e. setting variables which violate a box constraint to the respective boundary of the feasible domain, in combination with a repair of implausible scenarios provides good results.