Butnariu, Dan; Censor, Yair; Gurfil, Pini; Hadar, Ethan On the behavior of subgradient projections methods for convex feasibility problems in Euclidean spaces. (English) Zbl 1161.49033 SIAM J. Optim. 19, No. 2, 786-807 (2008). Summary: We study some methods of subgradient projections for solving a convex feasibility problem with general (not necessarily hyperplanes or half-spaces) convex sets in the inconsistent case and propose a strategy that controls the relaxation parameters in a specific self-adapting manner. This strategy leaves enough user flexibility but gives a mathematical guarantee for the algorithm’s behavior in the inconsistent case. We present the numerical results of computational experiments that illustrate the computational advantage of the new method. Cited in 19 Documents MSC: 49M37 Numerical methods based on nonlinear programming 90C25 Convex programming 49M15 Newton-type methods Keywords:convex feasibility problems; projection method; computational algorithms PDFBibTeX XMLCite \textit{D. Butnariu} et al., SIAM J. Optim. 19, No. 2, 786--807 (2008; Zbl 1161.49033) Full Text: DOI arXiv Link