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.
A hill-climbing algorithm will take the lunch of every algorithm listed here if you have a clean convex optimization problem.
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.