Algorithms for the quasiconvex feasibility problem
We study the behavior of subgradient projection algorithms for the quasiconvex feasibility problem of finding a point x^* in R^n that satisfies the inequalities f_i(x^*) less or equal 0, for all i=1,2,…,m, where all functions are continuous and quasiconvex. We consider the consistent case when the solution set is nonempty. Since the Fenchel-Moreau subdifferential might … Read more