A general framework for the over-relaxed A-proximal point algorithm and applications to inclusion problems
- Verma, Ram U.
DOIAbstract
AbstractFirst, a general framework for the over-relaxed A-proximal point algorithm based on the A-maximal monotonicity is introduced, and second it is applied to the approximation solvability of a general class of nonlinear inclusion problems using the generalized resolvent operator technique. The over-relaxed A-proximal point algorithm is of interest in the sense that it is quite application-oriented, but nontrivial in nature. The results obtained are general in nature
Add to ORKG![The Over-Relaxed <inline-formula> <graphic file="1687-1812-2011-840978-i1.gif"/></inline-formula>-Proximal Point Algorithm for General Nonlinear Mixed Set-Valued Inclusion Framework](/en/item/26118404/The-Over-Relaxed-lessinline-formulagreater-lessgraphic-file"1687-1812-2011-840978-i1.gif"greaterlessinline-formulagreater-Proximal-Point-Algorithm-for-General-Nonlinear-Mixed-Set-Valued-Inclusion-Framework){kind=link}