Serving the Quantitative Finance Community

 
User avatar
MikeCrowe
Topic Author
Posts: 0
Joined: January 16th, 2006, 8:20 am

"Hill climbing" algorithms

January 18th, 2006, 1:57 pm

Thanks you've helped lots!
 
User avatar
cybernicus
Posts: 0
Joined: January 1st, 2004, 3:01 pm

"Hill climbing" algorithms

February 5th, 2006, 4:47 pm

Genetic Algorithms is one of the best hill climbing method.
 
User avatar
zarnywhoop
Posts: 0
Joined: December 2nd, 2004, 5:39 pm

"Hill climbing" algorithms

February 7th, 2006, 8:17 am

QuoteOriginally posted by: cybernicusGenetic Algorithms is one of the best hill climbing method.Except for almost all the others. I've never encountered a problem for which GA were actually the best solution. In any given case there always seemed to be something else that worked better once the problem had been properly understood.
 
User avatar
MikeCrowe
Topic Author
Posts: 0
Joined: January 16th, 2006, 8:20 am

"Hill climbing" algorithms

February 7th, 2006, 8:47 am

QuoteOriginally posted by: zarnywhoopQuoteOriginally posted by: cybernicusGenetic Algorithms is one of the best hill climbing method.Except for almost all the others. I've never encountered a problem for which GA were actually the best solution. In any given case there always seemed to be something else that worked better once the problem had been properly understood.That is the crunch of it really, understanding the problem. If the "better" method, gives the same answer, but quicker, it could be argued that it is better to get a GA to do the work of "understanding" the problem than doing that by hand. This could particularly be true if you are going to do a lot of similar problems, so you understand the overall family, but not the intricate details of each specific case.Of course problems such as local minima etc HAVE to be sorted out and understood because you get the wrong answer otherwise.
 
User avatar
quantie
Posts: 20
Joined: October 18th, 2001, 8:47 am

"Hill climbing" algorithms

February 27th, 2006, 4:56 pm

QuoteOriginally posted by: MikeCroweAm just wondering what experiances people have with different minimisation algorithms... efficiency etc.I'm really looking at high dimension (1000+) multimodal functions (think backpropagation nets) and I'm struggling to get good convergence.Any suggestions/citations?I have been playing with PSO - particle swarm optimization and it seems to have good convergence on some test problems..rosenbrock's function and De-Jong's test function. I think random search combined with determinism is the way to go in such a high dimensional problem? I will post my r-code of PSO here soon.
Last edited by quantie on February 26th, 2006, 11:00 pm, edited 1 time in total.
 
User avatar
greenmax
Posts: 0
Joined: January 18th, 2006, 6:44 pm

"Hill climbing" algorithms

March 2nd, 2006, 2:32 pm

I second genetic algorithms (GAs). I dont want platform you are working on but I think MSDN has come out with a GAs toolbox.QuoteOriginally posted by: paboHave you thought about using a genetic algoritm? These are quite good for high dimensional optimisation.