The super-relaxed class of relatively proximal point algorithms and their roles to linear convergence analysis

zbMATH Open1197.49033MaRDI QIDQ3589388FDOQ3589388

Authors: Ram U. Verma 

Publication date: 20 September 2010

Recommendations

• New approach based on relatively inexact proximal point algorithms to linear convergence analysis and applications
• Relatively inexact proximal point algorithm and linear convergence analysis
• Generalized inexact proximal point algorithm and its role to linear convergence analysis
• scientific article
• On general inexact proximal point algorithms and their contributions to linear convergence analysis

zbMATH Keywords

maximal monotone mappinggeneralized resolvent operatorinclusion problemsrelatively maximal monotone mappingsuper-relaxed relatively proximal point algorithm

Mathematics Subject Classification ID

Monotone and positive operators on ordered Banach spaces or other ordered topological vector spaces (47H07)

Cited In (2)

• A unified and tight linear convergence analysis of the relaxed proximal point algorithm
• A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges

This page was built for publication: The super-relaxed class of relatively proximal point algorithms and their roles to linear convergence analysis

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