Aug 29, 2015 13:44
but this was very helpful
Aug 29, 2015 13:44
I actually have to run
Aug 29, 2015 13:44
well thanks for the discussion
Aug 29, 2015 13:43
ok
Aug 29, 2015 13:41
also I expect that my constraints will be highly nonlinear, which sounds like that will be a problem?
Aug 29, 2015 13:41
ok
Aug 29, 2015 13:39
ok
Aug 29, 2015 13:34
ok
Aug 29, 2015 13:31
ok
Aug 29, 2015 13:28
I have kind of gotten that impression given that I haven't been able to find much
Aug 29, 2015 13:28
ok
Aug 29, 2015 13:26
but am willing to if it helps makes a convergence argument
Aug 29, 2015 13:26
because as of now I am not really assuming anything about them
Aug 29, 2015 13:26
and that's why I have also been vague about what f and c are
Aug 29, 2015 13:25
was kind of a checklist of criteria to need to ensure teh method convereges
Aug 29, 2015 13:25
and so what I was hoping to get out of my posting of the question
Aug 29, 2015 13:25
just none that exactly fit my problem
Aug 29, 2015 13:25
and I have seen many papers out there on convergence proofs
Aug 29, 2015 13:25
yup
Aug 29, 2015 13:24
be it locally or globally
Aug 29, 2015 13:24
and so I am not too concerned about discovering the rate of convergence but just that it has convergent properties
Aug 29, 2015 13:23
which really means I run the code as long as I can until I run out of computational budget
Aug 29, 2015 13:23
and so i do this, iterating until convergence
Aug 29, 2015 13:22
so I am trying to pick new points, iteratively, that I think do better at minimizing f(x) while also satisfying c(x)
Aug 29, 2015 13:21
ok, I need more actual evaluations from the black box simulator, let's pick the next point that we think is best. And best is judged by will this value of x return a c(x) that meets the constraint and is smaller than my previous f(x)
Aug 29, 2015 13:20
the next thing we do is say
Aug 29, 2015 13:20
but so after I build my GP surrogate models
Aug 29, 2015 13:20
just not theoretical
Aug 29, 2015 13:20
and as of now I have empirical convergence
Aug 29, 2015 13:20
yes
Aug 29, 2015 13:19
yup
Aug 29, 2015 13:19
and they give me prediction at new x values
Aug 29, 2015 13:19
I build teh surrogates because they are cheaper to evaluate and work with
Aug 29, 2015 13:18
but in any event
Aug 29, 2015 13:18
Gaussian Processes (GP's) are also a special case of a radial basis function if your more familiar with that
Aug 29, 2015 13:18
similar
Aug 29, 2015 13:17
100%
Aug 29, 2015 13:17
so now I have an approximation for f(x) and c(x) because in the black box world the assumption is that evaluating the true f(x) and c(x) is computationally costly
Aug 29, 2015 13:16
I build a surrogate model for f(x) and c(x) using a Gaussian Process
Aug 29, 2015 13:15
from these "inputs" (x) and "outputs" (f(x),c(x))
Aug 29, 2015 13:15
I start with an initial set of points x and get back f(x) and c(x)
Aug 29, 2015 13:14
So what I do is
Aug 29, 2015 13:14
and so evaluating them is trivial
Aug 29, 2015 13:13
so I actually do know f(x) and c(x)
Aug 29, 2015 13:13
Well right now I am just running it on toy examples
Aug 29, 2015 13:12
So I can evaluate the computer simulator
Aug 29, 2015 13:11
That is correct
Aug 29, 2015 13:10
Or the idea of a black box simulator?
Aug 29, 2015 13:10
Are you familiar with black box optimization?
Aug 29, 2015 13:10
NIce!