کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4643599 1341395 2006 17 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Algorithms for the quasiconvex feasibility problem
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
Algorithms for the quasiconvex feasibility problem
چکیده انگلیسی

We study the behavior of subgradient projections algorithms for the quasiconvex feasibility problem of finding a point x*∈Rnx*∈Rn that satisfies the inequalities f1(x*)⩽0,f2(x*)⩽0,…,fm(x*)⩽0f1(x*)⩽0,f2(x*)⩽0,…,fm(x*)⩽0, where all functions are continuous and quasiconvex. We consider the consistent case when the solution set is nonempty. Since the Fenchel–Moreau subdifferential might be empty we look at different notions of the subdifferential and determine their suitability for our problem. We also determine conditions on the functions, that are needed for convergence of our algorithms. The quasiconvex functions on the left-hand side of the inequalities need not be differentiable but have to satisfy a Lipschitz or a Hölder condition.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Computational and Applied Mathematics - Volume 185, Issue 1, 1 January 2006, Pages 34–50
نویسندگان
, ,