میز خدمت الکترونیک
دوره ویراستاری

  اخبار و اعلانات

 آمار

تعداد نشریات127
تعداد شماره‌ها7,240
تعداد مقالات77,673
تعداد مشاهده مقاله161,286,311
تعداد دریافت فایل اصل مقاله120,868,229
Bagherpour, Negin, Minayi, Nima, Shanaghi, Amirhossein. (1405). An Accelerated Active-Set Algorithm for Convex Quadratic Programming. , 58(1), 49-59. doi: 10.22059/jac.2026.417507.1263
Negin Bagherpour; Nima Minayi; Amirhossein Shanaghi. "An Accelerated Active-Set Algorithm for Convex Quadratic Programming". , 58, 1, 1405, 49-59. doi: 10.22059/jac.2026.417507.1263
Bagherpour, Negin, Minayi, Nima, Shanaghi, Amirhossein. (1405). 'An Accelerated Active-Set Algorithm for Convex Quadratic Programming', , 58(1), pp. 49-59. doi: 10.22059/jac.2026.417507.1263
Bagherpour, Negin, Minayi, Nima, Shanaghi, Amirhossein. An Accelerated Active-Set Algorithm for Convex Quadratic Programming. , 1405; 58(1): 49-59. doi: 10.22059/jac.2026.417507.1263

An Accelerated Active-Set Algorithm for Convex Quadratic Programming

Journal of Algorithms and Computation
دوره 58، شماره 1، مهر 2026، صفحه 49-59    اصل مقاله (4.34 M)
نوع مقاله: Research Paper
شناسه دیجیتال (DOI): 10.22059/jac.2026.417507.1263
نویسندگان
Negin Bagherpour* 1؛ Nima Minayi2؛ Amirhossein Shanaghi3
1Department of Engineering Sciences, University of Tehran
2Department of Engineering Sciences, University of Tehran, Tehran, Iran
3Department of Engineering Sciences, University of Tehran, Tehran, Iran.
چکیده
Convex quadratic programming (QP) arises in many applications such as control theory, economics, and robotics. In this paper, we propose two active-set schemes for solving convex QP problems by exploiting structural properties of the Karush–Kuhn–Tucker (KKT) system. The proposed methods are implemented and tested on randomly generated problems as well as benchmark instances from the CUTEst test collection. In total, 2000 numerical experiments are conducted to evaluate the performance of the algorithms. The numerical results indicate that the proposed approaches reduce computational time compared with the classical active-set method, with the first strategy performing better for problems with few constraints and the second showing improved efficiency when the number of independent constraints is large.
کلیدواژه‌ها
Quadratic programming؛ Active Set؛ SVD؛ Spectral Decomposition؛ KKT
آمار
تعداد مشاهده مقاله: 50
تعداد دریافت فایل اصل مقاله: 33





سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب