Content deleted Content added
Tag: Reverted |
LouScheffer (talk | contribs) No, provably is correct. Depending on the problem, SA algorithms may or may not probably find the best solution. But in all cases, they cannot prove their solution is optimal. |
||
Line 39:
=== Optimization ===
[[Simulated annealing]], when used with a logarithmic cooling schedule, has been proven to find the global optimum of any optimization problem. However, such a cooling schedule results in entirely impractical runtimes, and is never used.<ref>{{cite journal |last1=Liang |first1=Faming |first2=Yichen |last2=Cheng |first3=Guang |last3=Lin |title=Simulated stochastic approximation annealing for global optimization with a square-root cooling schedule |journal=Journal of the American Statistical Association |volume=109 |issue=506 |year=2014 |pages=847–863|doi=10.1080/01621459.2013.872993 |s2cid=123410795 }}</ref> However, knowing this ideal algorithm exists has led to practical variants that are able to find very good (though not
=== Minimum Spanning Trees ===
| |||