Interior-point algorithm vs SQP algoritm
Show older comments
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.
Accepted Answer
More Answers (0)
Categories
Find more on Solver Outputs and Iterative Display in Help Center and File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!