Gradient Based and Gradient free Optimization
조회 수: 10 (최근 30일)
이전 댓글 표시
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
채택된 답변
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
추가 답변 (0개)
참고 항목
카테고리
Help Center 및 File Exchange에서 Problem-Based Optimization Setup에 대해 자세히 알아보기
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!