fmincon: interior-point & SQP computational complexity
30 ビュー (過去 30 日間)
古いコメントを表示
Hi! I have a very lage-scale optimization problem and I need to know the computational complexity of the interior-point algorithm as well as SQP so that I can estimate, roughly, the computational time of a given computer or cluster.
Thanks to all in advance!
0 件のコメント
回答 (1 件)
Alan Weiss
2019 年 3 月 11 日
This question can probably be best estimated by scaling the problem from small to medium to lmedium-arge, running fmincon on all scales, and extrapolating, rather than by doing a theoretical computation. It matters very much what kinds of constraints you have (bounds, linear, nonlinear), and whether constraint matrices are sparse or not.
As explained here, there can be large differences in performance between the interior-point algorithm (which is large-scale) and the sqp algorithm (which is not large-scale). See fmincon Algorithms.
The algorithm descriptions can be found in Constrained Nonlinear Optimization Algorithms, but I think that you would have to work pretty hard to get the complexity estimates out of those descriptions. Sorry, I don't know anything else.
Good luck,
Alan Weiss
MATLAB mathematical toolbox documentation
3 件のコメント
Carlo Cavicchia
2019 年 5 月 2 日
Hi, thanks for the information! Can you share with us the references of the computational complexity of SQP?
参考
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!