Constraint-reduced predictor corrector IPM for semidefinite programming
Constraint reduction is an essential method because the computational cost of the interior point methods can be effectively saved. Park and O'Leary proposed a constraint-reduced predictor-corrector algorithm for semidefinite programming with polynomial global convergence, but they did not show its superlinear convergence. We first develop a constraint-reduced algorithm for semidefinite programming having both polynomial global and superlinear local convergences. The new algorithm repeats a corrector step to have an iterate tangentially approach a central path, by which superlinear convergence can be achieved.
Citation pour cette source
Sungwoo Park (2024). Constraint-reduced predictor corrector IPM for semidefinite programming (https://www.mathworks.com/matlabcentral/fileexchange/54117-constraint-reduced-predictor-corrector-ipm-for-semidefinite-programming), MATLAB Central File Exchange. Récupéré le .
Compatibilité avec les versions de MATLAB
Plateformes compatibles
Windows macOS LinuxCatégories
Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Découvrir Live Editor
Créez des scripts avec du code, des résultats et du texte formaté dans un même document exécutable.
Version | Publié le | Notes de version | |
---|---|---|---|
1.0.0.0 |