On some properties of generalized proximal point methods for variational inequalities

DOI10.1023/A:1022670114963zbMath0905.90170MaRDI QIDQ1389080

Alfredo Noel Iusem

Publication date: 10 February 1999

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

variational inequalitylinear complementarity problemsinterior point methodsnonlinear complementarity problemsBregman distancegeneralized distancesgeneralized proximal point methods

Mathematics Subject Classification ID

Variational inequalities (49J40) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (5)

Proximal Methods with Penalization Effects in Banach Spaces ⋮ A generalized proximal-point-based prediction-correction method for variational inequality problems ⋮ On the existence and convergence of approximate solutions for equilibrium problems in Banach spaces ⋮ INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES ⋮ Central paths in semidefinite programming, generalized proximal-point method and Cauchy trajectories in Riemannian manifolds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A relaxed version of Bregman's method for convex programming
• An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
• Proximal minimization algorithm with \(D\)-functions
• Some properties of generalized proximal point methods for quadratic and linear programming
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• Monotone Operators and the Proximal Point Algorithm
• A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• Entropy-Like Proximal Methods in Convex Programming
• Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming

This page was built for publication: On some properties of generalized proximal point methods for variational inequalities