Algorithms for the quasiconvex feasibility problem (Q2570027): Difference between revisions

The possibilities of adapting some algorithmic approaches to solving the convex feasibility problem in order to become applicable to the quasiconvex feasibility problems (QFP) are investigated. Subgradient projections algorithms for this type of problems are taken into account. Different notions of subdifferentials are used to develop algorithms for the QFP for functions that are not necessarily differentiable, but have to satisfy a Lipschitz or a Hölder condition, which are needed for convergence.