Inexact Proximal Point Methods for Variational Inequality Problems

DOI10.1137/080733437zbMath1255.65108OpenAlexW2065346120WikidataQ58048475 ScholiaQ58048475MaRDI QIDQ3083304

Joydeep Dutta, Regina Sandra Burachik

Publication date: 21 March 2011

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://unisa.alma.exlibrisgroup.com/view/delivery/61USOUTHAUS_INST/12143232890001831

zbMATH Keywords

maximal monotone operatorsvariational inequalitiesBregman distancesgeneralized proximal point algorithmsdouble regularizationssecond-order homogeneous kernels

Mathematics Subject Classification ID

Convex programming (90C25) Programming in abstract spaces (90C48) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Numerical methods for variational inequalities and related problems (65K15)

Related Items (16)

A proximal method with logarithmic barrier for nonlinear complementarity problems ⋮ Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces ⋮ Inexact multi-objective local search proximal algorithms: application to group dynamic and distributive justice problems ⋮ Interior proximal extragradient method for equilibrium problems ⋮ The developments of proximal point algorithms ⋮ A projection algorithm for non-monotone variational inequalities ⋮ An interior proximal method for a class of quasimonotone variational inequalities ⋮ Nonlinear forward-backward splitting with momentum correction ⋮ Enlargements: a bridge between maximal monotonicity and convexity ⋮ Convergence rate of a proximal multiplier algorithm for separable convex minimization ⋮ Generalized Bregman envelopes and proximity operators ⋮ The Generalized Bregman Distance ⋮ Interior proximal method without the cutting plane property ⋮ Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis ⋮ Generalized Proximal Distances for Bilevel Equilibrium Problems ⋮ An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels

This page was built for publication: Inexact Proximal Point Methods for Variational Inequality Problems