Interior-point algorithm vs SQP algoritm
이전 댓글 표시
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개)
카테고리
도움말 센터 및 File Exchange에서 Solver Outputs and Iterative Display에 대해 자세히 알아보기
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!