Blind Man’s Method

  • Ding-Zhu Du
  • Panos M. Pardalos
  • Weili Wu
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 56)

Abstract

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.

Keywords

Stationary Point Topological Space Global Convergence Unconstrained Optimization Infinite Sequence 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 2001

Authors and Affiliations

  • Ding-Zhu Du
    • 1
  • Panos M. Pardalos
    • 2
  • Weili Wu
    • 1
  1. 1.Department of Computer Science and EngineeringUniversity of MinnesotaMinneapolisUSA
  2. 2.Center for Applied Optimization, ISE DepartmentUniversity of FloridaGainesvilleUSA

Personalised recommendations