Alfredo N. Iusem

Orcid: 0000-0002-5748-2501

Affiliations:
  • Instituto Nacional de Matemãtica Pura e Aplicada, Rio de Janeiro, Brazil


According to our database1, Alfredo N. Iusem authored at least 60 papers between 1990 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the centralization of the circumcentered-reflection method.
Math. Program., May, 2024

A successive centralized circumcentered-reflection method for the convex feasibility problem.
Comput. Optim. Appl., January, 2024

2022
Proximal Point Algorithms for Quasiconvex Pseudomonotone Equilibrium Problems.
J. Optim. Theory Appl., 2022

2021
An alternating direction method of multipliers for the eigenvalue complementarity problem.
Optim. Methods Softw., 2021

A Strongly Convergent Proximal Point Method for Vector Optimization.
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

Splitting methods for the Eigenvalue Complementarity Problem.
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

Optimality Conditions for Vector Equilibrium Problems with Applications.
J. Optim. Theory Appl., 2019

2017
Extragradient Method with Variance Reduction for Stochastic Variational Inequalities.
SIAM J. Optim., 2017

2016
On the numerical solution of the quadratic eigenvalue complementarity problem.
Numer. Algorithms, 2016

A proximal method with logarithmic barrier for nonlinear complementarity problems.
J. Glob. Optim., 2016

Preface.
J. Glob. Optim., 2016

On the quadratic eigenvalue complementarity problem.
J. Glob. Optim., 2016

2015
Full convergence of an approximate projection method for nonsmooth variational inequalities.
Math. Comput. Simul., 2015

On the Quadratic Eigenvalue Complementarity Problem over a general convex cone.
Appl. Math. Comput., 2015

2014
On the symmetric quadratic eigenvalue complementarity problem.
Optim. Methods Softw., 2014

Motzkin predecomposable sets.
J. Glob. Optim., 2014

A Levenberg-Marquardt method with approximate projections.
Comput. Optim. Appl., 2014

2013
The effect of calmness on the solution set of systems of nonlinear equations.
Math. Program., 2013

Fixed-Point Methods for a Certain Class of Operators.
J. Optim. Theory Appl., 2013

An Inexact Modified Subgradient Algorithm for Primal-Dual Problems via Augmented Lagrangians.
J. Optim. Theory Appl., 2013

Projections onto convex sets on the sphere.
J. Glob. Optim., 2013

2011
Korpelevich's method for variational inequality problems in Banach spaces.
J. Glob. Optim., 2011

2010
Augmented Lagrangian methods for variational inequality problems.
RAIRO Oper. Res., 2010

Duality and Exact Penalization for General Augmented Lagrangians.
J. Optim. Theory Appl., 2010

A primal dual modified subgradient algorithm with sharp Lagrangian.
J. Glob. Optim., 2010

Convergence of direct methods for paramonotone variational inequalities.
Comput. Optim. Appl., 2010

2009
Searching for critical angles in a convex cone.
Math. Program., 2009

On certain conditions for the existence of solutions of equilibrium problems.
Math. Program., 2009

2008
Antipodal pairs, critical pairs, and Nash angular equilibria in convex cones.
Optim. Methods Softw., 2008

Computing the radius of pointedness of a convex cone.
Math. Program., 2008

Preface.
Math. Program., 2008

Continuous optimization: 5th Brazilian workshop.
Math. Program., 2008

Antipodality in convex cones and distance to unpointedness.
Appl. Math. Lett., 2008

2007
Dual convergence of the proximal point method with Bregman distances for linear programming.
Optim. Methods Softw., 2007

2005
Proximal Methods in Vector Optimization.
SIAM J. Optim., 2005

On pairs of vectors achieving the maximal angle of a convex cone.
Math. Program., 2005

2004
A Projected Gradient Method for Vector Optimization Problems.
Comput. Optim. Appl., 2004

2003
Inexact Variants of the Proximal Point Algorithm without Monotonicity.
SIAM J. Optim., 2003

2001
On the need for hybrid steps in hybrid proximal point methods.
Oper. Res. Lett., 2001

2000
On the central path for nonlinear semidefinite programming.
RAIRO Oper. Res., 2000

On Dual Convergence of the Generalized Proximal Point Method with Bregman Distances.
Math. Oper. Res., 2000

Iterative Methods of Solving Stochastic Convex Feasibility Problems and Applications.
Comput. Optim. Appl., 2000

1999
A generalized proximal point algorithm for the nonlinear complementarity problem.
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
A row-action method for convex programming.
Math. Program., 1994

Entropy-Like Proximal Methods in Convex Programming.
Math. Oper. Res., 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

On the convergence of Han's method for convex programming with quadratic objective.
Math. Program., 1991

1990
On the Convergence Properties of Hildreth's Quadratic Programming Algorithm.
Math. Program., 1990


  Loading...