Why does the conventional QP solver quadprog of MATLAB using the interior-point algorithm not fully exploit the sparse structure of matrices?

3 vues (au cours des 30 derniers jours)
S.
S. le 23 Mar 2020
It seems that the quadprog function of MATLAB, the (conventional) interior-point algorithm, is not fully exploiting the sparsity and structure of the sparse QP formulation based on my results.
In Model Predictive Control, the computational complexity should scale linearly with the prediction horizon N. However, results show that the complexity scales quadratically with the prediction horizon N.
What can be possible explanations?

Connectez-vous pour répondre à cette question.

Réponses (0)

Catégories

En savoir plus sur Quadratic Programming and Cone Programming dans Help Center et File Exchange

Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by