Weierstrass's theorem

this theorem relates to the existence of minimization solution for an optimization problem.

Definition of min solution
Another expression

infimum n. 下确界

Weierstrass's theorem_第1张图片
Example of nonexistence of a minimizing solution
Weierstrass's theorem_第2张图片
Proof the existence of minimum solution with nonempty, compact set and continuous map
Weierstrass's theorem_第3张图片
definition of the cone of tangents
Weierstrass's theorem_第4张图片
examples of cone of tangents
Weierstrass's theorem_第5张图片
Step size scheme for self-regulated MSA

scheme and guarantee the convergence because this scheme satisfies the conditions.

MSA in a whole solution procedure

Weierstrass's theorem_第6张图片
Paste_Image.png

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.

Weierstrass's theorem_第7张图片
Paste_Image.png

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.

你可能感兴趣的:(Weierstrass's theorem)