Constraint-reduced predictor corrector IPM for semidefinite programming

버전 1.0.0.0 (16.8 KB) 작성자: Sungwoo Park
constraint-reduced predictor-corrector interior point method for semidefinite programming
다운로드 수: 161
업데이트 날짜: 2015/11/22

라이선스 보기

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.

인용 양식

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. 검색됨 .

MATLAB 릴리스 호환 정보
개발 환경: R2010a
모든 릴리스와 호환
플랫폼 호환성
Windows macOS Linux
카테고리
Help CenterMATLAB Answers에서 Link-Level Simulation에 대해 자세히 알아보기

Community Treasure Hunt

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

Start Hunting!
버전 게시됨 릴리스 정보
1.0.0.0