A hyperbolic penalty method to solve structured convex minimization problems
| المؤلف | Hamdi, A. |
| المؤلف | Al-Maadeed, T.K. |
| المؤلف | Taati, A. |
| تاريخ الإتاحة | 2023-09-24T07:55:32Z |
| تاريخ النشر | 2020 |
| اسم المنشور | International Journal of Advanced and Applied Sciences |
| المصدر | Scopus |
| الملخص | This paper presents a decomposition algorithm based on the smooth hyperbolic penalty, which leads to a scheme suitable for parallelized computations. The proposed algorithm can be seen as a separable version of the earlier hyperbolic penalty method built, and its main idea is related to a penalty-type scheme mixed with a kind of resource allocation approach to decompose large scale separable constrained minimization programs. 2020 The Authors. |
| راعي المشروع | This section is devoted to some numerical tests where we study the numerical behavior of the HDA. The study will tackle the feasibility, optimality, and stability of this method with respect to the parameters involved. Furthermore, an extension of the HDA, the Proximal Hyperbolic Decomposition Algorithm (PHDA), described below, is tested. This study is completed by a brief comparison involving HDA, PHDA, and the well-known strong CVX tool for some Convex Programming models developed by S.T. Boyd and M.C Grant from Standford University (Grant and Boyd, 2020). CVX is a Matlab-based modeling system for constructing and solving some convex programs (CPs). CVX supports a number of standard problem types, including linear and quadratic programs, and it is mainly based on primal-dual interior-point techniques. |
| اللغة | en |
| الناشر | Institute of Advanced Science Extension (IASE) |
| الموضوع | Convex functions Decomposition Hyperbolic penalty methods Large scale optimization |
| النوع | Article |
| الصفحات | 87-97 |
| رقم العدد | 5 |
| رقم المجلد | 7 |
الملفات في هذه التسجيلة
| الملفات | الحجم | الصيغة | العرض |
|---|---|---|---|
|
لا توجد ملفات لها صلة بهذه التسجيلة. |
|||
هذه التسجيلة تظهر في المجموعات التالية
-
الرياضيات والإحصاء والفيزياء [740 items ]