General system of \((A,\eta )\)-monotone variational inclusion problems based on generalized hybrid iterative algorithm

From MaRDI portal
Publication:2643441

DOI10.1016/j.nahs.2006.07.002zbMath1117.49014OpenAlexW2066045783MaRDI QIDQ2643441

Ram U. Verma

Publication date: 23 August 2007

Published in: Nonlinear Analysis. Hybrid Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.nahs.2006.07.002




Related Items

H(., ., .)- $$\eta $$ η -Proximal-Point Mapping with an ApplicationGeneralized over-relaxed proximal algorithm based ona-maximal monotonicity framework and applications to inclusion problemsGeneral class of implicit variational inclusions and graph convergence on \(A\)-maximal relaxed monotonicityIterative methods for the sum of two monotone operatorsGeneral over-relaxed proximal point algorithm involving \(A\)-maximal relaxed monotone mappings with applicationsAlgorithms of common solutions for variational inclusions, mixed equilibrium problems and fixed point problemsComposite schemes for variational inequalities over equilibrium problems and variational inclusionsIterative algorithms for variational inclusions, mixed equilibrium and fixed point problems with application to optimization problemsThe over-relaxed proximal point algorithm based on \(H\)-maximal monotonicity design and applicationsAn iterative algorithm for mixed equilibrium problems and variational inclusions approach to variational inequalitiesThe generalized relaxed proximal point algorithm involving A-maximal-relaxed accretive mappings with applications to Banach spacesGraph convergence for the \(H(\cdot , \cdot )\)-accretive operator in Banach spaces with an applicationIterative algorithms for quasi-variational inclusions and fixed point problems of pseudocontractionsA new relaxed proximal point procedure and applications to nonlinear variational inclusionsGeneral implicit variational inclusion problems based on \(A\)-maximal (\(m\))-relaxed monotonicity (AMRM) frameworksGeneralized Eckstein-Bertsekas proximal point algorithm based ona-maximal monotonicity designCommon solutions of an iterative scheme for variational inclusions, equilibrium problems, and fixed point problemsSystem of set-valued mixed quasi-variational-like inclusions involving \(H-\eta \)-monotone operators in Banach spacesRole of relative \(A\)-maximal monotonicity in overrelaxed proximal-point algorithms with ApplicationsGeneral proximal point algorithm involving \(\eta \)-maximal accretiveness framework in Banach spacesA new algorithm for finding a common solution of a split variational inequality problem, the fixed point problems and the variational inclusion problems



Cites Work