A proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in the presence of computational errors

DOI10.1016/j.na.2012.06.015zbMath1254.65078OpenAlexW2086259278MaRDI QIDQ448514

Zaslavski, Alexander J.

Publication date: 6 September 2012

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.na.2012.06.015

zbMATH Keywords

variational inequalityuniform convergencemaximal monotone operatorproximal point algorithmproximal point methodcomputational errornonexpansive operatorfinite dimensional space

Mathematics Subject Classification ID

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

Related Items (max. 100)

A Proximal Average for Prox-Bounded Functions ⋮ The proximal point algorithm revisited ⋮ Solving composite fixed point problems with block updates

Cites Work

• Unnamed Item
• Unnamed Item
• The subgradient extragradient method for solving variational inequalities in Hilbert space
• Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
• New approach to the \(\eta \)-proximal point algorithm and nonlinear variational inclusion problems
• Maximal monotone operators and the proximal point algorithm in the presence of computational errors
• Inexact proximal point methods in metric spaces
• A regularization method for the proximal point algorithm
• Nonlinear extended variational inequalities without differentiability: Applications and solution methods
• An inexact interior point proximal method for the variational inequality problem
• Descent method with inexact linesearch for mixed variational inequalities
• Monotone (nonlinear) operators in Hilbert space
• Proximal minimization algorithm with \(D\)-functions
• The proximal point algorithm in metric spaces
• Weak convergence of a projection algorithm for variational inequalities in a Banach space
• On the monotonicity of the gradient of a convex function
• Convergence of a Proximal Point Method in the Presence of Computational Errors in Hilbert Spaces
• On monotone variational inequalities with random data
• Asymptotic Convergence Analysis of a New Class of Proximal Point Methods
• Relaxed proximal point algorithms for variational inequalities with multi-valued operators
• The Proximal Average: Basic Theory
• On the Convergence of the Proximal Point Algorithm for Convex Minimization
• Monotone Operators and the Proximal Point Algorithm
• Perturbation des méthodes d'optimisation. Applications
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Bregman Monotone Optimization Algorithms
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• A Proximal-Projection Method for Finding Zeros of Set-Valued Operators
• Proximité et dualité dans un espace hilbertien
• Bregman-like functions and proximal methods for variational problems with nonlinear constraints

This page was built for publication: A proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in the presence of computational errors