Alfredo N. Iusem
Orcid: 0000-0002-5748-2501Affiliations:
- Instituto Nacional de Matemãtica Pura e Aplicada, Rio de Janeiro, Brazil
According to our database1,
Alfredo N. Iusem
authored at least 62 papers
between 1990 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
On csauthors.net:
Bibliography
2024
A Two-Step Proximal Point Algorithm for Nonconvex Equilibrium Problems with Applications to Fractional Programming.
J. Glob. Optim., November, 2024
Math. Program., May, 2024
A successive centralized circumcentered-reflection method for the convex feasibility problem.
Comput. Optim. Appl., January, 2024
SIAM J. Optim., 2024
2022
J. Optim. Theory Appl., 2022
2021
An alternating direction method of multipliers for the eigenvalue complementarity problem.
Optim. Methods Softw., 2021
J. Optim. Theory Appl., 2021
The circumcentered-reflection method achieves better rates than alternating projections.
Comput. Optim. Appl., 2021
2020
A Note on "Existence Results for Noncoercive Mixed Variational Inequalities in Finite Dimensional Spaces".
J. Optim. Theory Appl., 2020
Convergence analysis of the extragradient method for equilibrium problems in Hadamard spaces.
Comput. Appl. Math., 2020
2019
Variance-Based Extragradient Methods with Line Search for Stochastic Variational Inequalities.
SIAM J. Optim., 2019
Optim. Methods Softw., 2019
Incremental Constraint Projection Methods for Monotone Stochastic Variational Inequalities.
Math. Oper. Res., 2019
Existence Results for Noncoercive Mixed Variational Inequalities in Finite Dimensional Spaces.
J. Optim. Theory Appl., 2019
J. Optim. Theory Appl., 2019
2017
Extragradient Method with Variance Reduction for Stochastic Variational Inequalities.
SIAM J. Optim., 2017
2016
Numer. Algorithms, 2016
J. Glob. Optim., 2016
2015
Full convergence of an approximate projection method for nonsmooth variational inequalities.
Math. Comput. Simul., 2015
Appl. Math. Comput., 2015
2014
Optim. Methods Softw., 2014
Comput. Optim. Appl., 2014
2013
Math. Program., 2013
An Inexact Modified Subgradient Algorithm for Primal-Dual Problems via Augmented Lagrangians.
J. Optim. Theory Appl., 2013
2011
J. Glob. Optim., 2011
2010
RAIRO Oper. Res., 2010
J. Optim. Theory Appl., 2010
J. Glob. Optim., 2010
Comput. Optim. Appl., 2010
2009
Math. Program., 2009
2008
Optim. Methods Softw., 2008
2007
Dual convergence of the proximal point method with Bregman distances for linear programming.
Optim. Methods Softw., 2007
2005
Math. Program., 2005
2004
Comput. Optim. Appl., 2004
2003
SIAM J. Optim., 2003
2001
Oper. Res. Lett., 2001
2000
Math. Oper. Res., 2000
Iterative Methods of Solving Stochastic Convex Feasibility Problems and Applications.
Comput. Optim. Appl., 2000
1999
RAIRO Oper. Res., 1999
1998
A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space.
SIAM J. Optim., 1998
An interior point method with Bregman functions for the variational inequality problem with paramonotone operators.
Math. Program., 1998
On the projected subgradient method for nonsmooth convex optimization in a Hilbert space.
Math. Program., 1998
1995
Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming.
Math. Oper. Res., 1995
1994
1993
On the convergence of iterative methods for symmetric linear complementarity problems.
Math. Program., 1993
Convergence Properties of Iterative Methods for Symmetric Positive Semidefinite Linear Complementarity Problems.
Math. Oper. Res., 1993
1991
On Dual Convergence and the Rate of Primal Convergence of Bregman's Convex Programming Method.
SIAM J. Optim., 1991
Math. Program., 1991
1990
Math. Program., 1990