1. Minimization of functions having Lipschitz continuous first partial derivatives
2. The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming
3. Burachik R. S. Iusem A. N. A generalized proximal point algorithm for the variational inequality problem in a Hilbert space Pontificia Universidade Catolica Rio de Janeiro, Brazil 1995 Technical Report MAT- 07/95 S1A.V J. on Optimization, accepted for publication
4. Censor Y. Iusem A. N. Zenios S. A. An interior point method with Bregman functions for the variational inequality problem with paramonotone operators Department of Public and Business Administration, University of Cyprus Nicosia, Cyprus 1994 Technical Report 94-03 Mathematical Programming. accepted for publication
5. Proximal minimization algorithm withD-functions