کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9506700 | 1340755 | 2005 | 21 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A globally and superlinearly convergent feasible QP-free method for nonlinear programming
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A globally and superlinearly convergent feasible QP-free method for nonlinear programming A globally and superlinearly convergent feasible QP-free method for nonlinear programming](/preview/png/9506700.png)
چکیده انگلیسی
In this paper, we propose a QP-free type algorithm which solves the problem of minimizing a smooth function subject to smooth inequality constraints. In contrast with the SQP methods, each iteration this algorithm only needs to solve systems of linear equations which are derived from the equality part in the KKT first order optimality conditions. It is observed that, if the quasi-Newton direction is zero, we can obtain a direction of descent by dropping a constraint from the active set at the current iterate. A high order modified direction is introduced in order to prevent Maratos effect. Global and superlinear convergence are proven under some suitable conditions.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 168, Issue 1, 1 September 2005, Pages 519-539
Journal: Applied Mathematics and Computation - Volume 168, Issue 1, 1 September 2005, Pages 519-539
نویسندگان
Zhibin Zhu,