Showing papers on "Simulated annealing published in 1971"
01 Jan 1971
TL;DR: In this paper, a statistical solution to a general nonlinear programming problem is proposed, which does not make any assumptions about the convexity or quasiconvexity of any of the functions involved in the problem, and does not provide a guaranteed global optimum of the objective function, but is confined to the computation of a feasible and near optimum solution.
Abstract: : The paper provides a statistical solution to a very general problem in nonlinear programming. Specifically, it does not make any assumptions about the convexity (or, for that matter, quasiconvexity or pseudo-convexity) of any of the functions involved in the problem. On the other hand, it does not provide a guaranteed global optimum of the objective function, but is confined to the computation of a feasible and 'near optimum' solution, and the computation of confidence limits between which the global optimum is guaranteed to lie with a specified statistical confidence coefficient. (Author)
4 citations