Relaxed proximal point algorithms for variational inequalities with multi-valued operators

DOI10.1080/10556780801995790zbMath1154.90566MaRDI QIDQ3605206

E. Huebner, Rainer Tichatschke

Publication date: 23 February 2009

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780801995790

zbMATH Keywords

bundle method; multi-valued mappings; bregman functions; relaxed proximal point algorithm; \(\epsilon \)-enlargements of monotone operators

Mathematics Subject Classification ID

90C25: Convex programming

90C30: Nonlinear programming

47J20: Variational and other types of inequalities involving nonlinear operators (general)

65K10: Numerical optimization and variational techniques

47H05: Monotone operators and generalizations

65J20: Numerical solutions of ill-posed problems in abstract spaces; regularization

Related Items

An inertial Popov extragradient projection algorithm for solving multi-valued variational inequality problems, The extragradient method for solving variational inequalities in the presence of computational errors, A proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in the presence of computational errors, Surface fitting and registration of point clouds using approximations of the unsigned distance function, Approximately solving multi-valued variational inequalities by using a projection and contraction algorithm, Unnamed Item

Uses Software

• QL