Star subgradient projection for solving quasi-convex feasibility problems

Abstract

In this work we consider an iterative method for solving the quasi-convex feasibility problem. We firstly introduce the so-called star subgradient projection operator and present some useful properties. We subsequently obtain a convergence result of the considered method by using properties of the introduced nonlinear operator.

Submitted to a Conference