Blind Man’s Method
Finding a maximum point of a function is like climbing a mountain. When a blind man climbs a mountain, how does he do it? He is unable to see the global direction and may collect only local information with his stick. A naive way for him is to choose the steepest ascent direction at his current point (Figure 3.1) and along this direction climbs to a new point. In this chapter, we discuss this method of a blind man.
KeywordsStationary Point Topological Space Global Convergence Unconstrained Optimization Infinite Sequence
Unable to display preview. Download preview PDF.