کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
8904483 | 1633705 | 2017 | 19 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Smoothing Newton algorithm for the circular cone programming with a nonmonotone line search
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Smoothing Newton algorithm for the circular cone programming with a nonmonotone line search Smoothing Newton algorithm for the circular cone programming with a nonmonotone line search](/preview/png/8904483.png)
چکیده انگلیسی
In this paper, we present a nonmonotone smoothing Newton algorithm for solving the circular cone programming (CCP) problem in which a linear function is minimized or maximized over the intersection of an affine space with the circular cone. Based on the relationship between the circular cone and the second-order cone (SOC), we reformulate the CCP problem as the second-order cone problem (SOCP). By extending the nonmonotone line search for unconstrained optimization to the CCP, a nonmonotone smoothing Newton method is proposed for solving the CCP. Under suitable assumptions, the proposed algorithm is shown to be globally and locally quadratically convergent. Some preliminary numerical results indicate the effectiveness of the proposed algorithm for solving the CCP.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Acta Mathematica Scientia - Volume 37, Issue 5, September 2017, Pages 1262-1280
Journal: Acta Mathematica Scientia - Volume 37, Issue 5, September 2017, Pages 1262-1280
نویسندگان
Xiaoni CHI, Hongjin WEI, Zhongping WAN, Zhibin ZHU,