The Eckstein-Bertsekas proximal point algorithm and its applications to inclusion problems based on the generalized firm nonexpansiveness

zbMATH Open1189.49014MaRDI QIDQ3559565FDOQ3559565

Authors: Ram U. Verma 

Publication date: 6 May 2010

Recommendations

• Generalized Eckstein-Bertsekas proximal point algorithm based ona-maximal monotonicity design
• Generalized Eckstein-Bertsekas proximal point algorithm involving \((H,\eta )\)-monotonicity framework
• On the generalized proximal point algorithm with applications to inclusion problems
• Convergence of generalized proximal point algorithms
• On general over-relaxed proximal point algorithm and applications

zbMATH Keywords

Douglas-Rachford splitting methodEckstein-Bertsekas proximal point algorithmnonexpansiveness of the resolvent operator

Mathematics Subject Classification ID

Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Variational inequalities (49J40) Extrapolation to the limit, deferred corrections (65B05)

Cited In (1)

• Generalized Eckstein-Bertsekas proximal point algorithm based ona-maximal monotonicity design

This page was built for publication: The Eckstein-Bertsekas proximal point algorithm and its applications to inclusion problems based on the generalized firm nonexpansiveness

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