Answers are grounded in this paper and cite their sources.
Interior proximal methods for variational inequalities are, in fact, designed to handle problems on polyhedral convex sets or balls, only. Using a slightly modied concept of Bregman functions, we suggest an interior proximal method for solving variational inequalities (with maximal monotone operators) on convex, in general non-polyhedral sets, including in particular the case in which the set is described by a system of linear as well as strictly convex constraints. The convergence analysis of the method studied admits the use of the -enlargement of the operator and an inexact solution of the subproblems.
No takes yet. Share an insight, caveat, or question.
Kaplan et al. (2007) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: