Iterative algorithm for a convex feasibility problem

MaRDI QIDQ3569788zbMATHFDO

Authors Yu Li

Publication date 22 June 2010

Full work available at URL https://eudml.org/doc/228517

zbMATH Keywords

nonexpansive mappingstrong convergencevariational inequalityinverse-strongly monotone mappingconvex feasibility problem

Mathematics Subject Classification ID

Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Iterative procedures involving nonlinear operators (47J25) Equations involving nonlinear operators (general) (47J05)

Recommendations

• Convergence theorems of solutions of a generalized variational inequality
• On convex feasibility problems
• An algorithm of the modified iterative process for nonexpansive mappings
• Quasi-nonexpansivity and the convex feasibility problem
• Publication:4734695

Cited in

(6)

• Iterative linear programming solution of convex programs
• scientific article; zbMATH DE number 6378119 (Why is no real title available?)
• Iterative algorithm for solving a class of convex feasibility problem
• Split feasibility and fixed point problems
• An iterative algorithm for approximating convex minimization problem
• scientific article; zbMATH DE number 7339111 (Why is no real title available?)

This page was built for publication: Iterative algorithm for a convex feasibility problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569788)