An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities

In this paper, an entropy-like proximal method for the minimization of a convex function subject to positivity constraints is extended to an interior algorithm in two directions. First, to general linearly constrained convex minimization problems and second, to variational inequalities on polyhedra. For linear programming, numerical results are presented and quadratic convergence is established.Corresponding author. His research has been supported by C.E.E grants: CI1* CT 92-0046.