Gradient Based and Gradient free Optimization

20 次查看（过去 30 天）
Meddour Aissam riad
回答： Matt J 2020-3-12
Hi,
I'm trying to do a comparaison between the different opitimization algorithm in terms of Computation Time.
The algo that am using:
PSO_NM,GA,Fmincon,Pattern_Search,Sumulated_Anealing
From what i knew before, i suppose that the Gradient free Optimization algorithm are far slower then the gradien based one
But by doing my simulation i'm seeing the that the gradient free are faster
i was wondering why? can you suggest some supposation
i'm restrecting the boundary the most possible.
and my objectif function is very sensible in a way that if i change one coefficient value by 0.0001, i'll get inf as a results (a lot of peaks i suppose)

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

采纳的回答

Matt J
Matt J 2020-3-12
and my objectif function is very sensible in a way that if i change one coefficient value by 0.0001, i'll get inf as a results (a lot of peaks i suppose)
Gradient-based optimizers are designed for smooth functions (ones which have gradients). It sounds like your objective is not smooth at all!

更多回答（0 个）

类别

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

标签

Community Treasure Hunt

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

Start Hunting!

Translated by