Simulated Annealing (SA) is a smart (meta)-heuristic for Optimization. Given a cost function in a large search space, SA replaces the current solution by a random "nearby" solution. The nearby solution is chosen with a probability that depends on the

可以查找一个随机矩阵中的极大点，极小点，和鞍点，-Find a random matrix can be a great point, minima and saddle points,

可以查找一个随机矩阵中的极大点、极小点和鞍点-Find a random matrix can be a great point, minima and saddle points