this theorem relates to the existence of minimization solution for an optimization problem.
infimum n. 下确界
scheme and guarantee the convergence because this scheme satisfies the conditions.
MSA in a whole solution procedure
MSA is a step size adjust strategy that serves the whole decent direct based solution algorithm
It is also known that for more details, refer to Sheffi (1985)
MSA is a step-size adjust scheme in convex combination method.
So, the SUE solution problems consist of two steps: direction and step size. for the stepsize, the simplest way is MSA. for the direction, like dial's method the solution follow the logit model.
Critique of Logit-Based Network Loading, IID property
Dial's method still reflect logit model.
it can see, that algorithm is, of course, correct theoretically.
Next step is to debug in programs.
Anthony Chen 2009 self-adaptive method, said stop criteria is UE, so, it is inferred that it also exists SUE stop criteria. But, I am not sure.