On Fri, Oct 28, 2011 at 07:20:34AM -0700, Phil Steitz wrote:
> [...]
> BoundedPoint. As I said, this is what I tend to do at the moment, but
> I have mixed feelings about this solution vs. passing 3 double[]. Any
> thoughts about this side question?
> >>> On the principle, you
On 10/28/11 12:14 AM, Luc Maisonobe wrote:
> Le 28/10/2011 08:27, Sébastien Brisard a écrit :
>
> Hi Sébastien,
>
>> 2011/10/27 Gilles Sadowski :
>> The BOBYQA optimizer takes simple bound contraints into account:
>> lowerBound(i) <= p(i) <= upperBound(i)0 <= i < n
>> where "n" is
Hi Gilles,
>
>> > but this could be handled by
>> > returning eg a negative value.
>
> That's not very object-oriented. ;-)
>
Touché !
Best regards,
Sébastien
-
To unsubscribe, e-mail: dev-unsubscr...@commons.apache.org
For addi
Hi Luc,
2011/10/28 Luc Maisonobe :
> Le 28/10/2011 08:27, Sébastien Brisard a écrit :
>
> Hi Sébastien,
>
>> 2011/10/27 Gilles Sadowski :
>> The BOBYQA optimizer takes simple bound contraints into account:
>> lowerBound(i) <= p(i) <= upperBound(i) 0 <= i < n
>> where "n" is the pr
Hello.
> >>> [...]
> >>> In order to avoid this, what I tend to do at the moment is to define a
> >>> new class --say, BoundedPoint-- which would hold three double:s an
> >>> initial value, a lower bound and an upper bound. Then I would just
> >>> provide the method with the corresponding array of
Le 28/10/2011 08:27, Sébastien Brisard a écrit :
Hi Sébastien,
> 2011/10/27 Gilles Sadowski :
> The BOBYQA optimizer takes simple bound contraints into account:
> lowerBound(i) <= p(i) <= upperBound(i)0 <= i < n
> where "n" is the problem dimension.
>
> The parent class
2011/10/27 Gilles Sadowski :
>> >> The BOBYQA optimizer takes simple bound contraints into account:
>> >> lowerBound(i) <= p(i) <= upperBound(i) 0 <= i < n
>> >> where "n" is the problem dimension.
>> >>
>> >> The parent class ("BaseMultivariateRealOptimizer") currently mandates the
>> >> foll
> >> The BOBYQA optimizer takes simple bound contraints into account:
> >> lowerBound(i) <= p(i) <= upperBound(i)0 <= i < n
> >> where "n" is the problem dimension.
> >>
> >> The parent class ("BaseMultivariateRealOptimizer") currently mandates the
> >> following "optimize" method:
> >> ---CU
2011/10/27 Luc Maisonobe :
> Le 27/10/2011 14:45, Gilles Sadowski a écrit :
>> Hi.
>>
>> The BOBYQA optimizer takes simple bound contraints into account:
>> lowerBound(i) <= p(i) <= upperBound(i)0 <= i < n
>> where "n" is the problem dimension.
>>
>> The parent class ("BaseMultivariateRealOpt
Le 27/10/2011 14:45, Gilles Sadowski a écrit :
> Hi.
>
> The BOBYQA optimizer takes simple bound contraints into account:
> lowerBound(i) <= p(i) <= upperBound(i)0 <= i < n
> where "n" is the problem dimension.
>
> The parent class ("BaseMultivariateRealOptimizer") currently mandates the
>
+1
also valid for CMA-ES
Hi.
The BOBYQA optimizer takes simple bound contraints into account:
lowerBound(i) <= p(i) <= upperBound(i)0 <= i < n
where "n" is the problem dimension.
The parent class ("BaseMultivariateRealOptimizer") currently mandates the
following "optimize" method:
---CUT---
RealPointValuePair o
12 matches
Mail list logo
