Abstract

We study stability properties of a proximal point algorithm for solving the inclusion 0 ∈ T ( x ) when T is a set-valued mapping that is not necessarily monotone. More precisely we show that the convergence of our algorithm is uniform, in the sense that it is stable under small perturbations whenever the set-valued mapping T is metrically regular at a given solution. We present also an inexact proximal point method for strongly metrically subregular mappings and show that it is super-linearly convergent to a solution to the inclusion 0 ∈ T ( x ) .

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.