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

Nonlinear Sciences – Exactly Solvable and Integrable Systems

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

38 pages

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Proximal-Projection Method for Finding Zeros of Set-Valued Operators does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Proximal-Projection Method for Finding Zeros of Set-Valued Operators, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Proximal-Projection Method for Finding Zeros of Set-Valued Operators will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-214793

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.