Interior proximal method for variational inequalities: Case of nonparamonotone operators
type: Item
instance of: scholarly article
title: Interior proximal method for variational inequalities: Case of nonparamonotone operators
zbMATH Open document ID: 1072.65093
published in: Set-Valued Analysis
publication date: 2005-04-07T00:00:00Z
review text: The authors study the convergence of interior proximal methods with Bregman distance functionals for finding saddle points of Lagrangians of convex programs, as well as for nonlinear complementarity problems. The convergence results admit many interesting applications. The paper is informative. It will be immensely rewarding for the researchers.
reviewed by: Akrur Behera
Mathematics Subject Classification ID: 65K10
Mathematics Subject Classification ID: 49J40
Mathematics Subject Classification ID: 49M37
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 2153982
zbMATH Keywords: maximal monotone operators
zbMATH Keywords: proximal point methods
zbMATH Keywords: variational inequalities
zbMATH Keywords: regularization
zbMATH Keywords: convergence
zbMATH Keywords: Bregman distance functionals
zbMATH Keywords: convex programs
zbMATH Keywords: nonlinear complementarity problems
author: A. Kaplan
author: Rainer Tichatschke
MaRDI profile type: Publication
full work available at URL: s11228-004-4379-2
OpenAlex ID: W2127315776
cites work: An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
cites work: Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
cites work: A logarithmic-quadratic proximal method for variational inequalities
cites work: A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
cites work: Q5704056
cites work: Pseudomonotone variational inequality problems: Existence of solutions
cites work: Q4053162
cites work: Approximate iterations in Bregman-function-based proximal algorithms
cites work: Q3321366
cites work: Q4883218
cites work: Q4236159
cites work: An interior point method for constrained saddle point problems
cites work: Q4295274
cites work: Prox-regularization and solution of ill-posed elliptic variational inequalities
cites work: Proximal point approach and approximation of variational inequalities
cites work: Convergence analysis of non-quadratic proximal methods for variational inequalities in Hilbert spaces
cites work: Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
cites work: Q4026938
cites work: Q3491338
cites work: On the Maximality of Sums of Nonlinear Monotone Operators
cites work: Monotone Operators and the Proximal Point Algorithm
cites work: Q3549494
cites work: Q4362996
cites work: An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions
DOI: 10.1007/S11228-004-4379-2
description: scientific article; zbMATH DE number 2153982