Corrigendum to: ``The over-relaxed proximal point algorithm based on {H}-maximal monotonicity design and applications

DOI10.1016/J.CAMWA.2012.08.015zbMATH Open1268.49014OpenAlexW2024418070MaRDI QIDQ356281FDOQ356281

Publication date: 25 July 2013

Published in: Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2012.08.015

Recommendations

The over-relaxed proximal point algorithm based on \(H\)-maximal monotonicity design and applications
General over-relaxed proximal point algorithm involving \(A\)-maximal relaxed monotone mappings with applications
Role of relative \(A\)-maximal monotonicity in overrelaxed proximal-point algorithms with Applications
Generalized over-relaxed proximal algorithm based ona-maximal monotonicity framework and applications to inclusion problems
Convergence analysis of new over-relaxed proximal point algorithm frameworks with errors and applications to general \( A\)-monotone nonlinear inclusion forms
A remark on the over-relaxed proximal point algorithms relating to variational inclusions
A remark on the strong convergence of the over-relaxed proximal point algorithm
On over-relaxed \((A,{\eta},m)\)-proximal point algorithm frameworks with errors and applications to general variational inclusion problems
On general over-relaxed proximal point algorithm and applications

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Variational inequalities (49J40)

This page was built for publication: Corrigendum to: ``The over-relaxed proximal point algorithm based on {\(H\)}-maximal monotonicity design and applications

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