An inexact filter SQP algorithm for nonlinear programming

Publish Year: 1397
نوع سند: مقاله کنفرانسی
زبان: English
View: 316

متن کامل این Paper منتشر نشده است و فقط به صورت چکیده یا چکیده مبسوط در پایگاه موجود می باشد.
توضیح: معمولا کلیه مقالاتی که کمتر از ۵ صفحه باشند در پایگاه سیویلیکا اصل Paper (فول تکست) محسوب نمی شوند و فقط کاربران عضو بدون کسر اعتبار می توانند فایل آنها را دریافت نمایند.

  • Certificate
  • من نویسنده این مقاله هستم

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این Paper:

شناسه ملی سند علمی:

ICIORS11_153

تاریخ نمایه سازی: 30 دی 1397

Abstract:

We present a sequential quadratic programming algorithm for solving equality and inequality constrained nonlinear programming problems. In each step of this algorithm, the steering direction is computed by minimizing a linear model of the constraint violation. Using the steering direction, a feasible quadratic programming subproblem is defined. After that, an inexact solution of the subproblem, namely the predictor direction, is computed. The predictor solution must satisfy some loose conditions which are necessary to prove the global convergence of the algorithm. The search direction in each step of our algorithm is an appropriate convex combination of the steering direction and the predictor direction. The search direction is a descent direction for the constraint violation and objective function. So using a backtracking procedure a step length can be found such that the new trial point is acceptable by the filter or the exact penalty function is reduced. Hence the global convergence of the algorithm can be proved. We implement this algorithm in the MATLAB environment. The preliminary numerical experiment on some test problem proves the efficiency of the presented algorithm

Authors

H Ahmadzadeh

Department of Mathematical Sciences, Sharif University of Technology

N Mahdavi-Amiri

Department of Mathematical Sciences, Sharif University of Technology