A nonmonotone inexact filter SQP algorithm
Publish Year: 1398
نوع سند: مقاله کنفرانسی
زبان: English
View: 352
متن کامل این Paper منتشر نشده است و فقط به صورت چکیده یا چکیده مبسوط در پایگاه موجود می باشد.
توضیح: معمولا کلیه مقالاتی که کمتر از ۵ صفحه باشند در پایگاه سیویلیکا اصل Paper (فول تکست) محسوب نمی شوند و فقط کاربران عضو بدون کسر اعتبار می توانند فایل آنها را دریافت نمایند.
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
ICIORS12_244
تاریخ نمایه سازی: 24 شهریور 1398
Abstract:
We present a nonmonotone inexact filter sequential quadratic programming algorithm for solving general nonlinear programs. In each step of this algorithm, to find a search direction, a linear program is first solved to reduce the constraint violation and obtain the steering direction.Using the solution of this linear program, a feasible convex quadratic programming approximation is defined for the nonlinear problem. Instead of solving this subproblem exactly, we invoke a QP solver to find an inexact solution satisfying some loose and achievable conditions. This inexact solution is used as the search direction. The search direction is a descent direction for the constraint violation and/or the objective function. Moreover, it is a descent direction for the penalty function using an appropriate penalty parameter updating rule. To prevent an occurrence of the Maratos phenomenon, we use a nonmonotone line search procedure based on a filter technique. We implementthis algorithm using FORTRAN. The preliminary numerical experiment on some test problem shows the efficiency and reliability of the proposed algorithm
Keywords:
Authors
Hani Ahmadzadeh
Department of Mathematics, Sharif University of Technology, Tehran, Iran
Nezam Mahdavi-Amiri
Department of Mathematics, Sharif University of Technology, Tehran, Iran