Note on the paper: Interior proximal method for variational inequalities on non-polyhedral sets

DOI10.7151/dmdico.1111zbMath1214.47063OpenAlexW2324664502MaRDI QIDQ5748159

Alexander Kaplan, Rainer Tichatschke

Publication date: 14 September 2010

Published in: Discussiones Mathematicae. Differential Inclusions, Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmdico.1111

zbMATH Keywords

variational inequalitiesBregman functionproximal point algorithmnon-polyhedral feasible set

Mathematics Subject Classification ID

Convex programming (90C25) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Monotone operators and generalizations (47H05)

Related Items (10)

Interior proximal extragradient method for equilibrium problems ⋮ An inexact algorithm with proximal distances for variational inequalities ⋮ Interior point methods for equilibrium problems ⋮ An interior proximal method for a class of quasimonotone variational inequalities ⋮ An inexact proximal method with proximal distances for quasimonotone equilibrium problems ⋮ Interior proximal methods for quasiconvex optimization ⋮ Interior proximal method without the cutting plane property ⋮ Unnamed Item ⋮ Interior Proximal Methods for equilibrium programming: part II ⋮ Interior proximal methods for equilibrium programming: part I

This page was built for publication: Note on the paper: Interior proximal method for variational inequalities on non-polyhedral sets