commons-issues mailing list archives

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

    [ https://issues.apache.org/jira/browse/MATH-1026?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13774800#comment-13774800
] 

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 
{code}
Incrementor evaluations = p.getEvaluationCounter();
LeastSquaresProblem problem = LeastSquaresFactory.countEvaluations(p, evaluations);
{code}
instead of just
{code}
LeastSquaresProblem problem = LeastSquaresFactory.countEvaluations(p);
{code}
or
{code}
LeastSquaresProblem problem = LeastSquaresFactory.countEvaluations(p, p.getMaxEvaluations());
{code}

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: https://issues.apache.org/jira/browse/MATH-1026
>             Project: Commons Math
>          Issue Type: Improvement
>            Reporter: Evan Ward
>         Attachments: opt.tar.gz, opt.tar.gz
>
>
> See discussion on the mailing list starting with: http://www.mail-archive.com/dev@commons.apache.org/msg39681.html

--
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: http://www.atlassian.com/software/jira

Mime
View raw message