An interior-point algorithm for convex quadratic programming over symmetric cones

Publish Year: 1396
نوع سند: مقاله کنفرانسی
زبان: English
View: 395

This Paper With 8 Page And PDF Format Ready To Download

  • Certificate
  • من نویسنده این مقاله هستم

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این Paper:

شناسه ملی سند علمی:

ICIORS10_061

تاریخ نمایه سازی: 11 شهریور 1397

Abstract:

This paper analyses an interior-point algorithm for solving convex quadratic programming over symmetric cones. Here the objective function is a convex quadratic function and the feasible set is the intersection of an affine subspace and a symmetric cone associated with a Euclidean Jordan algebra. The algorithm utilizes the large class of commutative search directions introduced by Schmieta and Alizadeh [10] for arbitrary symmetric cones. The algorithm follows a wide neighborhood of the central path which makes the iterates capable of moving towards optimality with longer steps. Despite passing this pleasant feature, the complexity iteration bound still remains as good as the same result of Schmieta and Alizadeh forsymmetric cone optimization problems.

Authors

Soodabeh Asadi

۱Department of Applied Mathematics, Faculty of Mathematical Sciences, Shahrekord University, Shahrekord, Iran

Hossein Mansouri

Department of Applied Mathematics, Faculty of Mathematical Sciences, Shahrekord University, Shahrekord, Iran