A Proximal-Projection Method for Finding Zeros of Set-Valued Operators

From MaRDI portal
Publication:5320752

DOI10.1137/070682071zbMATH Open1208.90133arXiv0711.2351OpenAlexW1986743620MaRDI QIDQ5320752FDOQ5320752


Authors: Dan Butnariu, Gábor Kassay Edit this on Wikidata


Publication date: 22 July 2009

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Abstract: In this paper 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 Lemma Opial. 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 happen for maximal monotone operators, still converges when the operator involved in it is monotone with sequentially weakly closed graph.


Full work available at URL: https://arxiv.org/abs/0711.2351




Recommendations





Cited In (40)





This page was built for publication: A Proximal-Projection Method for Finding Zeros of Set-Valued Operators

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