Abstract In this paper, we propose two hybrid inertial CQ projection algorithms with line-search process for the split feasibility problem. Based on algorithm, firstly add term into iteration to accelerate convergence of and adopt flexible rules selecting stepsize shrinking region, which makes an optimal available at each iteration. The region is intersection three sets, are set C hyperplanes. ...

Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...

This paper investigates three categories of algorithms for direct volume rendering of unstructured grids, which are image-space, object-space, and hybrid methods. We propose three new algorithms. Cell Projection algorithm, which falls into object-space category, is capable of rendering non-convex meshes through a simple yet efficient sorting schema that exploits both image and object space cohe...