A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
From MaRDI portal
Publication:4389188
DOI10.1137/S1052623495286302zbMath0911.90273MaRDI QIDQ4389188
Alfredo Noel Iusem, Regina Sandra Burachik
Publication date: 12 May 1998
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
variational inequalitiesconvex optimizationmonotone operatorsBregman distancesproximal point methods
Related Items
Some recent advances in projection-type methods for variational inequalities ⋮ A note on the existence of zeroes of convexly regularized sums of maximal monotone operators ⋮ The proximal point method with a vectorial Bregman regularization in multiobjective DC programming ⋮ Proximal Methods with Penalization Effects in Banach Spaces ⋮ Convergence theorems for maximal monotone operators and fixed point problems in Banach spaces ⋮ Generalized proximal-type methods for weak vector variational inequality problems in Banach spaces ⋮ Some proximal algorithms for linearly constrained general variational inequalities ⋮ Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces ⋮ Interior proximal extragradient method for equilibrium problems ⋮ An inexact proximal method for quasiconvex minimization ⋮ Enlargement of monotone vector fields and an inexact proximal point method for variational inequalities in Hadamard manifolds ⋮ The prediction-correction approach to nonlinear complementarity problems ⋮ A logarithmic-quadratic proximal prediction-correction method for structured monotone variational inequalities ⋮ A simplified view of first order methods for optimization ⋮ The developments of proximal point algorithms ⋮ Extended auxiliary problem principle to variational inequalities involving multi-valued operators ⋮ First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems ⋮ On the linear convergence of a Bregman proximal point algorithm ⋮ Regularization in Banach spaces with respect to the Bregman distance ⋮ Interior point methods for equilibrium problems ⋮ On some properties of generalized proximal point methods for variational inequalities ⋮ Weak sharp solutions for generalized variational inequalities ⋮ An inexact scalarization proximal point method for multiobjective quasiconvex minimization ⋮ A Variational Inequality-Based Location-Allocation Algorithm for Locating Multiple Interactive Facilities ⋮ A generalized univariate Newton method motivated by proximal regularization ⋮ An interior proximal method for a class of quasimonotone variational inequalities ⋮ Randomized Lagrangian stochastic approximation for large-scale constrained stochastic Nash games ⋮ Bregman proximal point type algorithms for quasiconvex minimization ⋮ Interior proximal methods for quasiconvex optimization ⋮ A new predicto-corrector method for pseudomonotone nonlinear complementarity problems ⋮ An LQP method for pseudomonotone variational inequalities ⋮ On gap functions for multivalued Stampacchia variational inequalities ⋮ Composite iterative schemes for maximal monotone operators in reflexive Banach spaces ⋮ An extension of the proximal point algorithm with Bregman distances on Hadamard manifolds ⋮ Re-examination of Bregman functions and new properties of their divergences ⋮ An extragradient-type algorithm for variational inequality on Hadamard manifolds ⋮ Attouch-Théra duality revisited: Paramonotonicity and operator splitting ⋮ Finite convergence of a projected proximal point algorithm for the generalized variational inequalities ⋮ Pseudomonotone operators and the Bregman proximal point algorithm ⋮ A variational inequality approach for constrained multifacility Weber problem under gauge ⋮ An extragradient-type algorithm for non-smooth variational inequalities ⋮ Generalized Bregman envelopes and proximity operators ⋮ The Generalized Bregman Distance ⋮ Interior proximal method without the cutting plane property ⋮ A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach ⋮ Generalized proximal point algorithms for multiobjective optimization problems ⋮ A generalized proximal-point-based prediction-correction method for variational inequality problems ⋮ A new generalized APPA for maximal monotone operators ⋮ An inexact logarithmic-quadratic proximal augmented Lagrangian method for a class of constrained variational inequalities ⋮ On inexact generalized proximal methods with a weakened error tolerance criterion ⋮ A new criterion for the inexact logarithmic-quadratic proximal method and its derived hybrid methods ⋮ A primal-dual proximal point algorithm for constrained convex programs ⋮ Approximate generalized proximal-type method for convex vector optimization problem in Banach spaces ⋮ INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES ⋮ Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis ⋮ Interior proximal method for variational inequalities: Case of nonparamonotone operators ⋮ Interior Proximal Methods for equilibrium programming: part II ⋮ An interior proximal point algorithm for nonlinear complementarity problems ⋮ Solving a class of constrained `black-box' inverse variational inequalities ⋮ A hybrid inexact logarithmic-quadratic proximal method for nonlinear complementarity problems ⋮ On a generalized proximal point method for solving equilibrium problems in Banach spaces ⋮ A new logarithmic-quadratic proximal method for nonlinear complementarity problems ⋮ Local convergence analysis of projection-type algorithms: unified approach ⋮ A proximal point algorithm with asymmetric linear term ⋮ On a Bregman regularized proximal point method for solving equilibrium problems ⋮ An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels ⋮ Proximal-point algorithm using a linear proximal term ⋮ A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems ⋮ Proximal point algorithms for general variational inequalities ⋮ On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity ⋮ On a generalization of paramonotone maps and its application to solving the Stampacchia variational inequality ⋮ On finite convergence of proximal point algorithms for variational inequalities ⋮ The indefinite proximal point algorithms for maximal monotone operators ⋮ Nonlinear proximal decomposition method for convex programming ⋮ Interior proximal methods for equilibrium programming: part I
