کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4643232 | 1341372 | 2006 | 12 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A variant of SQP method for inequality constrained optimization and its global convergence
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A variant of SQP method for inequality constrained optimization and its global convergence A variant of SQP method for inequality constrained optimization and its global convergence](/preview/png/4643232.png)
چکیده انگلیسی
In this paper, a variant of SQP method for solving inequality constrained optimization is presented. This method uses a modified QP subproblem to generate a descent direction as each iteration and can overcome the possible difficulties that the QP subproblem of the standard SQP method is inconsistency. Furthermore, the method can start with an infeasible initial point. Under mild conditions, we prove that the algorithm either terminates as KKT point within finite steps or generates an infinite sequence whose accumulation point is a KKT point or satisfies certain first-order necessary condition. Finally, preliminary numerical results are reported.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Computational and Applied Mathematics - Volume 197, Issue 1, 1 December 2006, Pages 270–281
Journal: Journal of Computational and Applied Mathematics - Volume 197, Issue 1, 1 December 2006, Pages 270–281
نویسندگان
Jiangtao Mo, Kecun Zhang, Zengxin Wei,