A numerical study of an infeasible interior-point algorithm for convex quadratic semi-definite optimization

The focus of this research is to apply primal-dual interior-point pathfollowing methods, specifically those derived from Newton’s method for solving convex quadratic semidefinite optimization (CQSDO) problems. In this paper, we present a numerical study of an infeasible primal-dual interior-point m...

وصف كامل

التفاصيل البيبلوغرافية
الحاوية / القاعدة:Journal of Numerical Analysis and Approximation Theory
المؤلفون الرئيسيون: Yasmina Bendaas, Mohamed Achache
التنسيق: مقال
اللغة:الإنجليزية
منشور في: Publishing House of the Romanian Academy 2024-12-01
الموضوعات:
الوصول للمادة أونلاين:https://ictp.acad.ro/jnaat/journal/article/view/1442

مواد مشابهة