Comparison of Gradient Ascent and Hill Climbing

6 次查看（过去 30 天）
N/A
N/A 2016-11-19
回答： Alan Weiss 2016-11-21
I'm running both gradient ascent and hill climbing on a landscape to assess which one can reach the greatest height in less steps. The outcome of my test is that hill climbing always manages to reach greater heights in less increments in comparison to gradient ascent. What's reason behind this. Because I thought gradient ascent would be more efficient. Does anyone have experience with the algorithms that may have something to say.
Thank you.

请先登录，再回答此问题。

回答（1 个）

Alan Weiss
Alan Weiss 2016-11-21
This example might give you some ideas about potential problems with the steepest descent algorithm.
Efficient optimization algorithms use gradient information, but use an approximate Hessian instead of straightforward steepest descent. For details, see any optimization book, or the Optimization Toolbox documentation on nonlinear optimization algorithms.
Alan Weiss
MATLAB mathematical toolbox documentation

类别

在 Help Center 和 File Exchange 中查找有关 Choose a Solver 的更多信息

标签

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by