New approach to the -proximal point algorithm and nonlinear variational inclusion problems

DOI10.1016/J.AMC.2010.08.048zbMATH Open1211.65085OpenAlexW2036877880MaRDI QIDQ613240FDOQ613240

Ram U. Verma

Publication date: 20 December 2010

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2010.08.048

Recommendations

• The over-relaxed \(\eta\)-proximal point algorithm and nonlinear variational inclusion problems
• New proximal point algorithms based on generalized Yosida approximations applied to variational inclusions
• Super-relaxed \((\eta)\)-proximal point algorithms, relaxed \((\eta)\)-proximal point algorithms, linear convergence analysis, and nonlinear variational inclusions
• scientific article
• Relatively relaxed proximal point algorithms and their roles to approximation solvability of nonlinear variational inclusion problems based on generalized Yosida approximations

zbMATH Keywords

convergence analysisevolution equationsmaximal monotone mappingvariational inclusionsYosida approximationgeneralized resolvent operatorgeneral firm nonexpansivenessmaximal \(\eta \)-monotone mappingover-relaxed \((\eta )\)-proximal point algorithm

Mathematics Subject Classification ID

Variational inequalities (49J40) Numerical methods for variational inequalities and related problems (65K15)

Cites Work

• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
• Linear convergence of epsilon-subgradient descent methods for a class of convex functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Approximate iterations in Bregman-function-based proximal algorithms
• On the maximal monotonicity of subdifferential mappings
• The Ljusternik-Schnirelman theory for indefinite and not necessarily odd nonlinear operators and its applications
• A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
• ON A „MONOTONICITY” METHOD FOR THE SOLUTION OF NONLINEAR EQUATIONS IN BANACH SPACES
• Finite termination of the proximal point algorithm
• On the differentiability and the representation of one-parameter semi-group of linear operators
• Necessary and sufficient conditions for a penalty method to be exact
• Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
• Title not available (Why is that?)
• \(A\)-monotonicity and its role in nonlinear variational inclusions
• Enlarging the region of convergence of Newton's method for constrained optimization
• An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• Composition duality and maximal monotonicity
• The perturbed proximal point algorithm and some of its applications
• A-monotone nonlinear relaxed cocoercive variational inclusions
• Mixed equilibrium problems: sensitivity analysis and algorithmic aspect.
• Approximation solvability of a class of nonlinear set-valued variational inclusions involving \((A,\eta )\)-monotone mappings
• LJUSTERNIK-SCHNIRELMAN Theory on General Level Sets
• Smooth methods of multipliers for complementarity problems
• Finding a zero of the sum of two maximal monotone operators
• On the generalized proximal point algorithm with applications to inclusion problems
• General projection systems and relaxed cocoercive nonlinear variational inequalities
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• A proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in the presence of computational errors
• Relatively maximal monotone mappings and applications to general inclusions
• Inexact \(A\)-proximal point algorithm and applications to nonlinear variational inclusion problems

This page was built for publication: New approach to the \(\eta \)-proximal point algorithm and nonlinear variational inclusion problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q613240)