A penalty method for solving nonsmooth constrained optimization problems

سال انتشار: 1396
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 351

فایل این مقاله در 7 صفحه با فرمت PDF قابل دریافت می باشد

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

لینک ثابت به این مقاله:

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

ICIORS10_116

تاریخ نمایه سازی: 11 شهریور 1397

چکیده مقاله:

We introduce an algorithm to solve a locally Lipschitz constrained minimization problem. The method generates second order descent directions to minimize an ℓ1 penalty function. We introduce a new criterion to decide upon acceptability of a Goldstein subdifferential approximation. We show that the new criterion leads to an improvement of the Goldstein subdifferential approximation, as introduced by Mahdavi-Amiri and Yousefpour. Also, making use of our proposed line search strategy, we show that the method always moves on differentiable points. Furthermore, the method has an adaptive behaviour in the sense that, when the iterates move on adequately smooth regions, the search directions switch exactly to the Shanno s conjugate gradient directions and no subdifferential approximation is computed. The global convergence of the method is established.

نویسندگان

M Shaeiri

Faculty of Mathematical Sciences, Sharif University of Technology, Tehran, Iran

N Mahdavi-Amiri

Faculty of Mathematical Sciences, Sharif University of Technology, Tehran, Iran