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

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

Authors: 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; zbMATH DE number 5614144
• 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

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

Cited In (7)

• New proximal point algorithms based on generalized Yosida approximations applied to variational inclusions
• Relaxed \(\eta\)-proximal operator for solving a variational-like inclusion problem
• A proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in the presence of computational errors
• Super-relaxed \((\eta)\)-proximal point algorithms, relaxed \((\eta)\)-proximal point algorithms, linear convergence analysis, and nonlinear variational inclusions
• The over-relaxed \(\eta\)-proximal point algorithm and nonlinear variational inclusion problems
• 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)