Levenberg–Marquardt algorithm: Difference between revisions

Content deleted Content added
Alanb (talk | contribs)
Alanb (talk | contribs)
Line 42:
Obviously the absolute values of any choice depends on how well-scaled the initial problem is. Marquadt recommended starting with a value &lambda;<sub>0</sub> and a factor &nu;>1. Initiall set &lambda;=&lambda;<sub>0</sub>; and computing the residual sum of squares after one step from the starting point with the damping factor of
&lambda;=&lambda;<sub>0</sub>; and secondly with &lambda;/&nu; If both of these are worse than the initial point then the damping is increased by successive multiplication by &nu; until a better point is found with a new damping factor of &lambda; &nu;<sup>k</sup>
for some '''k'''.
 
If use damping factor &lambda;/&nu; results in a reduction in squared residual then this is taken as the new value of &lambda; (and the new optimum ___location is taken as that obtained with this damping factor) and the process continues; if using &lambda;/&nu; resulted in a worse residual, but using &lambda; resulted in a better residual then &lamda; is left unchanged and the new optimum is taken as the value obatined with &lambda; as damping factor.