Definition of Global Convergence I am confused by the notion of "global convergence" as used in numerical optimization literature, and did not find an exact definition for that yet.
Now I try to double check my understanding here.

It clearly is NOT concerned with convergence to the global minimum. 
Does it mean convergence to a local minimum regardless of the initial point? (How about local maximum, saddle point?) What methods do not have global convergence? Those that with selection of bad initial point can stop in an arbitrary non-critical point?

Also, a globally convergence method applied on a convex function, gives the global minima, right?
See the definition in http://papers.nips.cc/paper/3646-on-the-convergence-of-the-concave-convex-procedure.pdf. 
The points generated by an algorithm with this property 


converge for any initial point.
converge to a stationary point.
As far as I know optimisation would be the search for maxima/minima.

If you'd imagine your function being a mountain chain, the optimum would equal a peak 
or a valley.

To find the minima or maxima you could calculate the gradient of the function 
and starting from an initial point change the values of this initial point
into the direction the gradient is pointing in until you reach the peak/valley,
which would -- in most cases -- be a local optimum. 

Global convergence  would hence be convergence to the global optimum regardless
of the initial starting point.  

Hope this helps.

Edit:
Global Convergence is indeed the convergence to Minima/Maxima regardless
of the initial starting point.