Totally convex functions for fixed points computation and infinite dimensional optimization D Butnariu, AN Iusem Springer Science & Business Media, 2000 | 380 | 2000 |

Enlargements of Monotone Operators RS Burachik, AN Iusem Set-Valued Mappings and Enlargements of Monotone Operators, 161-220, 2008 | 277 | 2008 |

A variant of Korpelevich’s method for variational inequalities with a new search strategy AN Iusem, BF Svaiter Optimization 42 (4), 309-321, 1997 | 241 | 1997 |

Enlargement of monotone operators with applications to variational inequalities RS Burachik, AN Iusem, BF Svaiter Set-Valued Analysis 5 (2), 159-180, 1997 | 229 | 1997 |

Entropy-like proximal methods in convex programming AN Iusem, BF Svaiter, M Teboulle Mathematics of Operations Research 19 (4), 790-814, 1994 | 202 | 1994 |

On the projected subgradient method for nonsmooth convex optimization in a Hilbert space YI Alber, AN Iusem, MV Solodov Mathematical Programming 81 (1), 23-35, 1998 | 179 | 1998 |

A generalized proximal point algorithm for the variational inequality problem in a Hilbert space RS Burachik, AN Iusem SIAM journal on Optimization 8 (1), 197-216, 1998 | 177 | 1998 |

New existence results for equilibrium problems AN Iusem, W Sosa Nonlinear Analysis: Theory, Methods & Applications 52 (2), 621-635, 2003 | 175 | 2003 |

An interior point method with Bregman functions for the variational inequality problem with paramonotone operators Y Censor, AN Iusem, SA Zenios Mathematical Programming 81 (3), 373-400, 1998 | 163 | 1998 |

On certain conditions for the existence of solutions of equilibrium problems AN Iusem, G Kassay, W Sosa Mathematical Programming 116 (1), 259-273, 2009 | 153 | 2009 |

Iterative algorithms for equilibrium problems AN Iusem, W Sosa Optimization 52 (3), 301-316, 2003 | 150 | 2003 |

Proximal methods in vector optimization H Bonnel, AN Iusem, BF Svaiter SIAM Journal on Optimization 15 (4), 953-970, 2005 | 147 | 2005 |

Full convergence of the steepest descent method with inexact line searches R Burachik, LM Graņa Drummond, AN Iusem, BF Svaiter Optimization 32 (2), 137-146, 1995 | 145 | 1995 |

A projected gradient method for vector optimization problems LMG Drummond, AN Iusem Computational Optimization and applications 28 (1), 5-29, 2004 | 142 | 2004 |

A relaxed version of Bregman's method for convex programming AR De Pierro, AN Iusem Journal of Optimization Theory and Applications 51 (3), 421-440, 1986 | 125 | 1986 |

An iterative algorithm for the variational inequality problem NI ALFREDO Computational and Applied Mathematics 13, 103-114, 1994 | 121 | 1994 |

On the proximal point method for equilibrium problems in Hilbert spaces AN Iusem, W Sosa Optimization 59 (8), 1259-1274, 2010 | 113 | 2010 |

On some properties of paramonotone operators AN Iusem Journal of Convex Analysis 5, 269-278, 1998 | 105 | 1998 |

On the convergence properties of the projected gradient method for convex optimization AN Iusem Computational & Applied Mathematics 22, 37-52, 2003 | 100 | 2003 |

On the convergence of Han's method for convex programming with quadratic objective AN Iusem, AR De Pierro Mathematical Programming 52 (1), 265-284, 1991 | 100 | 1991 |