On over-relaxed \((A,{\eta},m)\)-proximal point algorithm frameworks with errors and applications to general variational inclusion problems

DOI10.1186/1029-242X-2013-97zbMath1417.47021WikidataQ59301648 ScholiaQ59301648MaRDI QIDQ2636711

Heng-you Lan

Publication date: 31 January 2014

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

zbMATH Keywords

convergence analysis\((A,{\eta},m)\)-monotonicitygeneral variational inclusion problemgeneralized proximal operator techniqueover-relaxed \((A,{\eta},m)\)-proximal point algorithm frameworks with errors

Mathematics Subject Classification ID

Variational and other types of inequalities involving nonlinear operators (general) (47J20) Iterative procedures involving nonlinear operators (47J25)

Related Items (1)

The over-relaxed scheme based on \(H(\cdot ,\cdot )\)-cocoercive operators for solving a generalized variational inclusion problem

Cites Work

• A remark on the strong convergence of the over-relaxed proximal point algorithm
• On the convergence rate of the over-relaxed proximal point algorithm
• \(A\)-monotonicity and its role in nonlinear variational inclusions
• Inexact \(A\)-proximal point algorithm and applications to nonlinear variational inclusion problems
• A general framework for the over-relaxed A-proximal point algorithm and applications to inclusion problems
• A hybrid proximal point algorithm based on the \((A,\eta )\)-maximal monotonicity framework
• On general over-relaxed proximal point algorithm and applications

This page was built for publication: On over-relaxed \((A,{\eta},m)\)-proximal point algorithm frameworks with errors and applications to general variational inclusion problems