利用Plastria提出的拟凸函数lower次微分,借鉴凸可行问题的投影算法,给出了一个拟凸可行问题的投影算法.并证明了该算法的收敛性.
In the light of projection algorithms for the convex feasibility problem, a projection algorithm was proposed for quasiconvex feasibility problem based on Plastria' s lower subdifferential.The convergence of the algorithm was proved.