MATLAB Answers

Gradient Based and Gradient free Optimization

14 views (last 30 days)
Meddour Aissam riad
Meddour Aissam riad on 12 Mar 2020
Answered: Matt J on 12 Mar 2020
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)

  0 Comments

Sign in to comment.

Accepted Answer

Matt J
Matt J on 12 Mar 2020
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 Comments

Sign in to comment.

More Answers (0)

Sign in to answer this question.