Optimization Online


Algorithms for the quasiconvex feasibility problem

Yair Censor (yair***at***math.haifa.ac.il)
Alexander Segal (asegal***at***math.haifa.ac.il)

Abstract: 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 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 holder condition.

Keywords: Quasiconvex feasibility, subdifferentials, Holder condition,Konnov's method,Eremin's method, subgradients.

Category 1: Convex and Nonsmooth Optimization

Citation: Journal of Computational and Applied Mathematics, Vol. 185 (2006), pp. 34-50.


Entry Submitted: 01/27/2005
Entry Accepted: 01/27/2005
Entry Last Modified: 09/04/2005

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society