Nonconvex optimization by fast simulated annealing

Harold H Szu, Ralph L. Hartley · Proceedings of the IEEE · 1987

Recent advances in the solution of nonconvex optimization problems use simulated annealing techniques that are considerably faster than exhaustive global search techniques. This letter presents a simulated annealing technique, which is t/log (t) times faster than conventional simulated annealing, and applies it to a multisensor location and tracking problem.

Read the paper · More papers on PaperTik