This is the mail archive of the
gsl-discuss@sourceware.org
mailing list for the GSL project.
Re: [Help-gsl] Comments/questions about BFGS algorithm implementedfor the GSL
- From: "Brian Gough" <bjg at network-theory dot co dot uk>
- To: James Bergstra <james dot bergstra at umontreal dot ca>
- Cc: help-gsl at gnu dot org, gsl-discuss at sources dot redhat dot com
- Date: Mon, 12 Jun 2006 15:35:26 +0100
- Subject: Re: [Help-gsl] Comments/questions about BFGS algorithm implementedfor the GSL
- References: <Pine.LNX.4.60.0604140016360.26180@puvpxnqrr.zlyna.ubzr><17477.16448.182343.87618@hp2.network-theory.co.uk><Pine.LNX.4.60.0604181431090.26180@puvpxnqrr.zlyna.ubzr><Pine.LNX.4.60.0604201532380.26180@puvpxnqrr.zlyna.ubzr><Pine.LNX.4.60.0606041620340.25941@puvpxnqrr.zlyna.ubzr><17543.9810.301485.22694@hp2.network-theory.co.uk><20060608204217.GA6980@grieg.iro.umontreal.ca>
James Bergstra writes:
> I am guessing, that the todo list has:
> - implement revised line search as an alternative implementation of
> "directional_minimize.c" ?
Yes, I want to put this in the next release.
> - add testing framework for minimization algos
> - add rosenbrock to test cases
I think we have the rosenbrock function in the tests already.
--
Brian Gough