CIVILICA We Respect the Science
(ناشر تخصصی کنفرانسهای کشور / شماره مجوز انتشارات از وزارت فرهنگ و ارشاد اسلامی: ۸۹۷۱)

Solving Large Scale Nonlinear Optimization Programming via a Relatively Efficient Algorithm

عنوان مقاله: Solving Large Scale Nonlinear Optimization Programming via a Relatively Efficient Algorithm
شناسه ملی مقاله: NEEC02_188
منتشر شده در دومین کنفرانس ملی مهندسی برق در سال 1388
مشخصات نویسندگان مقاله:

Alireza Mohebi Ashtiani - Faculty of Electrical and Computer Engineering, State University of Campinas, Campinas, SP, Brazil
Seyed Mansour Saeidi - Department of Basic Sciences, Islamic Azad University of Mahshahr, Mahshahr, Khuzestan, Iran

خلاصه مقاله:
In this work, we proposed a relatively efficient algorithm for solving the class of large scale optimization programming problem. In fact, we develop a primal dual algorithm which, it can be seen that, is efficient when the problem is really belongs to the class of large scale programming problems. It also can be seen that, the method is not expensive and can be coded easily into a convenient programming language

کلمات کلیدی:
Large-scale optimization, interior point methods, nonlinear programming, constrained optimization, quasi-Newton methods

صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/86801/