Abstract

We consider the convergence rate of the proximal point algorithm (PPA) for finding a minimizer of proper lower semicontinuous convex functions. In the Hilbert space setting, Güler showed that the big-O rate of the PPA can be improved to little-o when the sequence generated by the algorithm converges strongly to a minimizer. In this paper, we establish little-o rate of the PPA in Banach spaces without requiring this assumption. Then we apply the result to give new results on the convergence rate for sequences of alternating and averaged projections.

Full Text
Paper version not known

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.