Loading…
Optimization with hidden constraints and embedded Monte Carlo computations
In this paper we explore the convergence properties of deterministic direct search methods when the objective function contains a stochastic or Monte Carlo simulation. We present new results for the case where the objective is only defined on a set with certain minimal regularity properties. We pres...
Saved in:
Published in: | Optimization and engineering 2016-03, Vol.17 (1), p.157-175 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | In this paper we explore the convergence properties of deterministic direct search methods when the objective function contains a stochastic or Monte Carlo simulation. We present new results for the case where the objective is only defined on a set with certain minimal regularity properties. We present two numerical examples to illustrate the ideas. |
---|---|
ISSN: | 1389-4420 1573-2924 |
DOI: | 10.1007/s11081-015-9302-1 |