pablo wrote:Hello,
I have been running multi-state models using the simulated annealing algorithm that take a rather long-time to converge,
While I'll have to leave the 'bug' you've described for Gary to answer/fix (i.e., the selected optimization technique not being saved...), this is a good opportunity to point out that the simulated annealing method Pablo is talking about is the method used if you select 'Alternate optimization' in the numuerical estimation window (its one of the radio-boxes on the right hand side).
Simulated annealing is a generalization of a Monte Carlo method for examining and solving n-dimensional state equations - and was first described ( I think) by Metropolis et al. (1953) - he of Metropolis-Hasting fame for you Bayesians. Originally described for application to the rate at which crystals annealed - but I think I slept through that part of my physical chemistry class. Its a standard entry in any numerical recipe book you might lay your hands on.
OK, why do you care?
1. good news - simulated annealing is much less likely to suffer the problems of local, non-global minima. Such local minima are surprsingly (annoyingly) common in MS models, for reasons which aren't entirely well-known (see recent work by Giminez).
2. bad news - simulated annealing is MUCH slower than basic Newton-Raphson (or the equivalent). Try it yourself and see. To really test how much of a machine you have on your desk, use SA and profile likelihood-based CI's.
So, you get what you pay for (cost = time). Whenever I get 'weirdness' in models, especially MS models, I typically run SA just to confirm that the 'problem' isn't a local minima.