Hi guys(adsbygoogle = window.adsbygoogle || []).push({});

I posted something similar some time ago:

This is a long story, I make it short:

I am working in a project where I need to find a matrix defined by a third degree polynomial.

Originally I thought that a good idea can be to find the solution iteratively using a gradient descent technique, so I implemented a golden section line search in matlab (with the code described below).

The algorithm looks powerful (it finds automatically the perfect step), but unfortunately the golden section line search does not avoid being stuck in local minima.

So I moved to a stochastic approach like simulated annealing, now the problem is that with my objective function the default convergence never happens.

So I have to force annealing to stop. BUT WHEN ?

I tried after some iteration but the annealing has the defect that at some point it randomize his trusted region and maybe when I stop it, it is really far from the minima (I am using too many iterations). And I have the same problem with time limit. So when I should stop the minima the search ?

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

Code using the golden section:

%Initial third degree polynomial

Cest = initial_guess;

normdev=inf ;

stepsize=inf;

%Stopping condition

stopping_condition = 10^(-5) *norm(X*X'/no_samples,'fro');

while abs(normdev*stepsize) > stopping_condition

%Third degree polynomial

dnew = Cest - 1/no_samples*(X*X' - 2/sigma^2 * (Cest*Cest'*Cest-Cest*B'*Cest));

%Find the best stepsize as a minimum using the goldensection line search

stepsize = fminbnd( @(stepsize) step(stepsize,Cest,dnew,X*X',B,sigma,no_samples),-.1,.1);

%Update

Cest = Cest + stepsize*dnew;

normdev = norm(dnew,'fro');

end

function error = step(stepsize,Cest,dnew,XX,B,sigma,no_samples)

Cest = Cest + stepsize*dnew;

error = norm(Cest - 1/no_samples*(XX - 2/sigma^2 * (Cest^3-Cest*B*Cest)),'fro');

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

Code using the simulated annealing:

Cest = initial_point;

lb = -20*ones(size(Cest));

ub = 20*ones(size(Cest));

options = saoptimset('MaxIter',300) ;

Cest = simulannealbnd(@(funcobj) myfuncobj(Cest ,X*X',B,sigma,no_samples),Cest,lb,ub, options);

function error = myfuncobj( Cest, XX, B, sigma, no_samples)

error = norm(Cest - 1/no_samples*(XX - 2/sigma^2 * (Cest^3-Cest*B*Cest)),'fro');

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# When to stop a simulate annealing when it doesn't stop by itself

Loading...

Similar Threads - stop simulate annealing | Date |
---|---|

A Stopping rule for quality control problem | Sep 2, 2016 |

Stochastic queue simulation | Jul 22, 2015 |

Help me get a girlfriend with math (optimal stopping theory/secretary | Nov 1, 2013 |

Meeting a friend at a train stop | Feb 21, 2012 |

The probability that a driver stopping at petrol station | Jan 2, 2011 |

**Physics Forums - The Fusion of Science and Community**