The generalized relaxed proximal point algorithm involving A-maximal-relaxed accretive mappings with applications to Banach spaces
DOI10.1016/J.MCM.2009.04.012zbMath1185.90203OpenAlexW2078746121MaRDI QIDQ969994
Publication date: 8 May 2010
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2009.04.012
variational inclusionsgeneralized resolvent operator\(A\)-maximal accretive mappingmaximal-relaxed accretive mapping
Optimality conditions and duality in mathematical programming (90C46) Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15)
Related Items (10)
Cites Work
- On a new system of nonlinear \(A\)-monotone multivalued variational inclusions
- \(A\)-monotonicity and its role in nonlinear variational inclusions
- General system of \(A\)-monotone nonlinear variational inclusion problems with applications
- Role of relative \(A\)-maximal monotonicity in overrelaxed proximal-point algorithms with Applications
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Composition duality and maximal monotonicity
- Mixed equilibrium problems: sensitivity analysis and algorithmic aspect.
- A-monotone nonlinear relaxed cocoercive variational inclusions
- Approximation solvability of a class of nonlinear set-valued variational inclusions involving \((A,\eta )\)-monotone mappings
- Nonlinear relaxed cocoercive variational inclusions involving \((A,\eta)\)-accretive mappings in Banach spaces
- Sensitivity analysis for generalized strongly monotone variational inclusions based on the \((A,\eta )\)-resolvent operator technique
- General system of \((A,\eta )\)-monotone variational inclusion problems based on generalized hybrid iterative algorithm
- Iterative Algorithms for Nonlinear Operators
- Inequalities in Banach spaces with applications
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- A class of projection-contraction methods applied to monotone variational inequalities
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The generalized relaxed proximal point algorithm involving A-maximal-relaxed accretive mappings with applications to Banach spaces