Dual adaptive stochastic block projection algorithm for solving convex feasibility problem in support vector machines
摘要
In this paper, we consider a class of convex feasibility problem, which arises in support vector machines. Based on the stochastic block projection algorithm with adaptive extrapolation, we design a dual adaptive stochastic block projection algorithm to solve this problem. The convergence analysis of the new algorithm is given. Finally, some numerical examples demonstrate that our proposed algorithm is feasible and effective.