News for hackers. Stuff that matters.

A comment on The Traveling Salesman with Simulated Annealing, R, and Shiny. Parent comment

Re:The Traveling Salesman with Simulated Annealing, R, and S... by scishop on Wednesday September 17, 2014 @03:09PM (#8331798)
No. It's completely context dependent.

A hill-climbing algorithm will take the lunch of every algorithm listed here if you have a clean convex optimization problem.

[ Parent | on HN ]
Re:The Traveling Salesman with Simulated Annealing, R, and S... by chromaton on Wednesday September 17, 2014 @03:14PM (#8331824)
Where would you find such a problem in the real world?
[ Parent | on HN ]
Re:The Traveling Salesman with Simulated Annealing, R, and S... by gh02t on Wednesday September 17, 2014 @03:53PM (#8332030)
Absolutely everywhere, it is a common subproblem in many many algorithms. For example, the basin hopping algorithm (sister of SA) solves one at every step.

A specific example is in image deblurring via Tikhonov regularization, which involves minimizing a function that is provably convex for many physically realistic types of blurring.

[ Parent | on HN ]