Interior-point algorithm vs SQP algoritm
조회 수: 39 (최근 30일)
이전 댓글 표시
Hi, I am running an optimal design problem by using fmincon with sqp algorithm and interior-point algorithm. SQP algorithm was found the optimal and the exit message was (Local minimum found) while interior-point algorithm was given an exit flag (2) with exit message (Local minimum possible). So I used the optimum value which is given from SQP and re-run interior-point algorithm , but I still get tha same message (Local minimum possible). Why sqp was found the optimal wile interior-point algorithm did not? Thanks to all in advance.
댓글 수: 0
채택된 답변
Alan Weiss
2015년 7월 8일
Perhaps you are running into an inaccuracy due to using an interior-point method, or perhaps your problem has very high curvature or some other irregularity. It is hard to know based on the information you supplied.
Did you check the value that the interior-point algorithm gave? Was it unsatisfactory? Did you consult the documentation on Local Minimum Possible? It might give you some ideas about what is going on.
Good luck,
Alan Weiss
MATLAB mathematical toolbox documentation
추가 답변 (0개)
참고 항목
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!