commons-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Evan Ward (JIRA)" <>
Subject [jira] [Commented] (MATH-1026) Separate Optimization Problem from Algorithm
Date Mon, 23 Sep 2013 18:09:03 GMT


Evan Ward commented on MATH-1026:

While attempting to implement 3. I realized that the Optimum needs to know the number of evaluations.
This means that the code would have to read 
Incrementor evaluations = p.getEvaluationCounter();
LeastSquaresProblem problem = LeastSquaresFactory.countEvaluations(p, evaluations);
instead of just
LeastSquaresProblem problem = LeastSquaresFactory.countEvaluations(p);
LeastSquaresProblem problem = LeastSquaresFactory.countEvaluations(p, p.getMaxEvaluations());

I suppose it would still be easier to have the evaluation counter automatically incremented,
but it is not very clear how {{evaluations}} keeps the correct value.

> Separate Optimization Problem from Algorithm
> --------------------------------------------
>                 Key: MATH-1026
>                 URL:
>             Project: Commons Math
>          Issue Type: Improvement
>            Reporter: Evan Ward
>         Attachments: opt.tar.gz, opt.tar.gz
> See discussion on the mailing list starting with:

This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators
For more information on JIRA, see:

View raw message