Butnariu, Dan; Kassay, Gábor A proximal-projection method for finding zeros of set-valued operators. (English) Zbl 1208.90133 SIAM J. Control Optim. 47, No. 4, 2096-2136 (2008). Summary: We study the convergence of an iterative algorithm for finding zeros with constraints for not necessarily monotone set-valued operators in a reflexive Banach space. This algorithm, which we call the proximal-projection method is, essentially, a fixed point procedure, and our convergence results are based on new generalizations of the Browder’s demiclosedness principle. We show how the proximal-projection method can be applied for solving ill-posed variational inequalities and convex optimization problems with data given or computable by approximations only. The convergence properties of the proximal-projection method we establish also allow us to prove that the proximal point method (with Bregman distances), whose convergence was known to occur for maximal monotone operators, still converges when the operator involved in it is monotone with sequentially weakly closed graph. Cited in 37 Documents MSC: 90C25 Convex programming 47J25 Iterative procedures involving nonlinear operators 47J20 Variational and other types of inequalities involving nonlinear operators (general) 90C30 Nonlinear programming 90C48 Programming in abstract spaces 47N10 Applications of operator theory in optimization, convex analysis, mathematical programming, economics Keywords:Bregman distance; firmly nonexpansive operator; Legendre function; operator; Tikhonov-Browder regularization; uniformly convex function PDFBibTeX XMLCite \textit{D. Butnariu} and \textit{G. Kassay}, SIAM J. Control Optim. 47, No. 4, 2096--2136 (2008; Zbl 1208.90133) Full Text: DOI arXiv