摘要

A new relaxed algorithmic procedure based on the notion of A-maximal relaxed monotonicity is developed, and then the convergence analysis in the context of solving a general class of nonlinear inclusion problems is examined. Furthermore, some results involving A-maximal relaxed monotone mappings in a Hilbert space setting are included.

  • 出版日期2009-10