Super-relaxed \((\eta)\)-proximal point algorithms, relaxed \((\eta)\)-proximal point algorithms, linear convergence analysis, and nonlinear variational inclusions

DOI10.1155/2009/957407zbMath1186.47054OpenAlexW2031951973WikidataQ59249140 ScholiaQ59249140MaRDI QIDQ1035134

Ram U. Verma, Ravi P. Agarwal

Publication date: 10 November 2009

Published in: Fixed Point Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/45709

zbMATH Keywords

maximal \((\eta)\)-monotonicitynonlinear variational inclusion problems

Mathematics Subject Classification ID

Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25) Set-valued operators (47H04) Variational and other types of inclusions (47J22)

Related Items

Role of relative \(A\)-maximal monotonicity in overrelaxed proximal-point algorithms with Applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(A\)-monotonicity and its role in nonlinear variational inclusions
• The generalized relaxed proximal point algorithm involving A-maximal-relaxed accretive mappings with applications to Banach spaces
• General proximal point algorithm involving \(\eta \)-maximal accretiveness framework in Banach spaces
• Monotone (nonlinear) operators in Hilbert space
• Finite termination of the proximal point algorithm
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• Approximate iterations in Bregman-function-based proximal algorithms
• Composition duality and maximal monotonicity
• The perturbed proximal point algorithm and some of its applications
• Finding a zero of the sum of two maximal monotone operators
• Mixed equilibrium problems: sensitivity analysis and algorithmic aspect.
• Linear convergence of epsilon-subgradient descent methods for a class of convex functions
• Smooth methods of multipliers for complementarity problems
• Forcing strong convergence of proximal point iterations in a Hilbert space
• On the generalized proximal point algorithm with applications to inclusion problems
• A-monotone nonlinear relaxed cocoercive variational inclusions
• Approximation solvability of a class of nonlinear set-valued variational inclusions involving \((A,\eta )\)-monotone mappings
• On the maximal monotonicity of subdifferential mappings
• On the differentiability and the representation of one-parameter semi-group of linear operators
• An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
• Iterative Algorithms for Nonlinear Operators
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• General projection systems and relaxed cocoercive nonlinear variational inequalities
• Continuity of Generalized Gradients and Multipliers Under Perturbations
• LJUSTERNIK-SCHNIRELMAN Theory on General Level Sets
• The Ljusternik-Schnirelman theory for indefinite and not necessarily odd nonlinear operators and its applications
• Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
• On the Convergence of the Proximal Point Algorithm for Convex Minimization
• Necessary and sufficient conditions for a penalty method to be exact
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Variational Analysis
• Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings