Minimization — Global Methods

  • Stan Z. Li
Part of the Computer Science Workbench book series (WORKBENCH)


The minimal solution is usually defined as the global one or one of them when there are multiple global minima. Finding a global minimum is non-trivial if the energy function contains many local minima. Whereas methods for local minimization are quite mature with commercial software on market, the study of global minimization is still young. There are no efficient algorithms which guarantee to find globally minimal solutions as are there for local minimization.


Local Minimum Simulated Annealing Initial Configuration Global Method Minimal Label 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Japan 2001

Authors and Affiliations

  • Stan Z. Li
    • 1
  1. 1.Beijing Sigma CenterMicrosoft Research ChinaBeijingChina

Personalised recommendations