Re: [Jprogramming] deoptim package

2013-10-16 Thread Ric Sherlock
I like your first suggested interpretation - bounds are a known region within which the minimum lies (otherwise IMO they belong as constraints). The Matlab approach of clipping solutions to the bounds sounds pragmatic. Did you want to have a go at implementing that in the addon? On Thu, Oct 17, 2

Re: [Jprogramming] deoptim package

2013-10-16 Thread Thomas Costigliola
Thanks Ric. Using a constraint function worked, but with noticeable slowdown. I was looking at the page describing the algorithm that was linked in the description of the add on. Without trying to get into too much detail and unless I am misunderstanding it, it seems like if you have an existing s

Re: [Jprogramming] deoptim package

2013-10-10 Thread Ric Sherlock
No I don't think so. My vague memory is that because the generation of new solutions is essentially done by generating differences between existing legal solutions, the phenomena you describe should be unlikely. A workaround (that wouldn't involve modifying the addon) would be to build bounds check

[Jprogramming] deoptim package

2013-10-10 Thread Thomas Costigliola
When using deoptim I am getting solutions outside of the bounds I am providing. >From looking at the code it looks like new populations are generated within the bounds but the evolution step doesn't ensure the boundary conditions. Is that the intended behavior?