Alfredo Noel Iusem | Academic Influence

Alfredo Noel Iusem's AcademicInfluence.com Rankings

Alfredo Noel Iusem

Mathematics

#4052

World Rank

#5839

Historical Rank

Group Theory

#164

World Rank

#195

Historical Rank

Number Theory

#269

World Rank

#339

Historical Rank

Algebra

#370

World Rank

#514

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Alfredo Noel Iusem's Degrees

PhD Mathematics University of Buenos Aires
Masters Mathematics University of Buenos Aires
Bachelors Mathematics University of Buenos Aires

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Alfredo Noel Iusem Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Alfredo Noel Iusem is an Argentine-born Brazilian mathematician working on mathematical optimization. He earned his Ph.D. from Stanford University in 1981 under the supervision of George Bernard Dantzig.

(See a Problem?)

Alfredo Noel Iusem's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Totally Convex Functions for Fixed Points Computation and Infinite Dimensional Optimization (2000) (351)
Set-valued mappings and enlargements of monotone operators (2008) (286)
A variant of korpelevich’s method for variational inequalities with a new search strategy (1997) (258)
Enlargement of Monotone Operators with Applications to Variational Inequalities (1997) (201)
On the projected subgradient method for nonsmooth convex optimization in a Hilbert space (1998) (188)
Proximal Methods in Vector Optimization (2005) (174)
New existence results for equilibrium problems (2003) (172)
Entropy-Like Proximal Methods in Convex Programming (1994) (172)
On certain conditions for the existence of solutions of equilibrium problems (2008) (165)
A Projected Gradient Method for Vector Optimization Problems (2004) (161)
An interior point method with Bregman functions for the variational inequality problem with paramonotone operators (1998) (151)
A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space (1998) (151)
Iterative Algorithms for Equilibrium Problems (2003) (147)
Full convergence of the steepest descent method with inexact line searches (1995) (136)
On the proximal point method for equilibrium problems in Hilbert spaces (2010) (121)
Extragradient Method with Variance Reduction for Stochastic Variational Inequalities (2017) (114)
Korpelevich’s method for variational inequality problems in Banach spaces (2011) (108)
On some properties of paramonotone operators. (1998) (107)
A relaxed version of Bregman's method for convex programming (1986) (106)
On the convergence properties of the projected gradient method for convex optimization (2003) (94)
Inexact Variants of the Proximal Point Algorithm without Monotonicity (2002) (83)
On Uniform Convexity, Total Convexity and Convergence of the Proximal Point and Outer Bregman Projection Algorithms in Banach Spaces (2003) (83)
Convergence results for an accelerated nonlinear cimmino algorithm (1986) (82)
On the convergence of Han's method for convex programming with quadratic objective (1991) (82)
A simultaneous projections method for linear inequalities (1985) (74)
A Strongly Convergent Direct Method for Monotone Variational Inequalities in Hilbert Spaces (2009) (73)
Convergence of direct methods for paramonotone variational inequalities (2010) (66)
Preconditioned conjugate gradient method for generalized least squares problems (1996) (64)
INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES (2001) (62)
Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming (1995) (57)
Total Convexity for Powers of the Norm in Uniformly Convex Banach Spaces (2000) (57)
Augmented Lagrangian Methods and Proximal Point Methods for Convex Optimization (1999) (54)
Inexact Proximal Point Methods for Equilibrium Problems in Banach Spaces (2007) (54)
A finitely convergent “row-action” method for the convex feasibility problem (1988) (53)
An extragradient-type algorithm for non-smooth variational inequalities (2000) (48)
On the convergence properties of Hildreth's quadratic programming algorithm (1990) (46)
On pairs of vectors achieving the maximal angle of a convex cone (2005) (46)
Concepts and techniques of optimization on the sphere (2014) (45)
On the Maximal Monotonicity of Diagonal Subdifferential Operators (2010) (45)
The expectation-maximization algorithm for ill-posed integral equations: a convergence analysis (2007) (44)
An explicit algorithm for monotone variational inequalities (2012) (43)
On iterative methods for linearly constrained entropy maximization (1990) (41)
Some properties of generalized proximal point methods for quadratic and linear programming (1995) (39)
Axiomatization of the index of pointedness for closed convex cones (2005) (39)
A simultaneous iterative method for computing projections on polyhedra (1987) (39)
Searching for critical angles in a convex cone (2009) (38)
Maximal Monotone Operators (2008) (37)
Variance-Based Extragradient Methods with Line Search for Stochastic Variational Inequalities (2019) (36)
Duality and Exact Penalization for General Augmented Lagrangians (2010) (36)
Incremental Constraint Projection Methods for Monotone Stochastic Variational Inequalities (2017) (35)
Central Paths, Generalized Proximal Point Methods, and Cauchy Trajectories in Riemannian Manifolds (1999) (35)
Projections onto convex sets on the sphere (2013) (34)
A Strongly Convergent Method for Nonsmooth Convex Minimization in Hilbert Spaces (2011) (34)
On a proximal point method for convex optimization in banach spaces (1997) (33)
The effect of calmness on the solution set of systems of nonlinear equations (2013) (33)
Convergence analysis for a multiplicatively relaxed EM algorithm (1991) (33)
Optimization of Burg's entropy over linear constraints (1991) (31)
An existence result for quasi-equilibrium problems (2014) (31)
A proximal point method for nonsmooth convex optimization problems in Banach spaces (1997) (30)
Iterative Methods of Solving Stochastic Convex Feasibility Problems and Applications (2000) (30)
On the asymtotic behavior of some alternate smoothing series expansion iterative methods (1990) (29)
A Levenberg-Marquardt method with approximate projections (2014) (28)
Minimization Of Nonsmooth Convex Functionals In Banach Spaces (1997) (27)
Angular analysis of two classes of non-polyhedral convex cones: the point of view of optimization theory (2007) (25)
On Dual Convergence and the Rate of Primal Convergence of Bregman's Convex Programming Method (1991) (25)
A primal dual modified subgradient algorithm with sharp Lagrangian (2010) (24)
Motzkin decomposition of closed convex sets via truncation (2013) (23)
Normality and modulability indices. Part II Convex cones in hilbert spaces (2008) (22)
Measuring the degree of pointedness of a closed convex cone: a metric approach (2006) (22)
Optimality Conditions for Vector Equilibrium Problems with Applications (2018) (21)
Proximal Methods with Penalization Effects in Banach Spaces (2004) (21)
Antipodal pairs, critical pairs, and Nash angular equilibria in convex cones (2008) (20)
On the convergence of iterative methods for symmetric linear complementarity problems (1993) (20)
Proximal methods in reflexive Banach spaces without monotonicity (2007) (19)
Pointedness, Connectedness, and Convergence Results in the Space of Closed Convex Cones (2004) (18)
On convex cones with infinitely many critical angles (2007) (18)
A proximal regularization of the steepest descent method (1995) (17)
A row-action method for convex programming (1994) (16)
On Some Properties of Generalized Proximal Point Methods for Variational Inequalities (1998) (16)
A new smoothing-regularization approach for a maximum-likelihood estimation problem (1994) (15)
Normality and modulability indices . Part I : Convex cones in normed spaces (2007) (15)
On the symmetric quadratic eigenvalue complementarity problem (2014) (15)
Extragradient methods for nonsmooth equilibrium problems in Banach spaces (2020) (15)
Existence Results for Noncoercive Mixed Variational Inequalities in Finite Dimensional Spaces (2019) (14)
Motzkin predecomposable sets (2014) (13)
Augmented Lagrangian methods for variational inequality problems (2010) (13)
On the quadratic eigenvalue complementarity problem (2016) (13)
Full convergence of an approximate projection method for nonsmooth variational inequalities (2015) (13)
Order preserving and order reversing operators on the class of convex functions in Banach spaces (2012) (13)
A generalized proximal point algorithm for the nonlinear complementarity problem (1999) (13)
On Dual Convergence of the Generalized Proximal Point Method with Bregman Distances (2000) (12)
An Inexact Modified Subgradient Algorithm for Primal-Dual Problems via Augmented Lagrangians (2013) (12)
Extragradient Methods for Vector Equilibrium Problems in Banach Spaces (2019) (12)
The circumcentered-reflection method achieves better rates than alternating projections (2020) (11)
Preconditioned sor methods for generalized least-squares problems (2000) (11)
Splitting methods for the Eigenvalue Complementarity Problem (2018) (11)
The exact penalty map for nonsmooth and nonconvex optimization (2015) (11)
On First Order Optimality Conditions for Vector Optimization (2003) (11)
Variance-based stochastic extragradient methods with line search for stochastic variational inequalities (2017) (11)
On the need for hybrid steps in hybrid proximal point methods (2001) (10)
On finitely convergent iterative methods for the convex feasibility problem (1987) (10)
A Proximal Point Method in Nonreflexive Banach Spaces (2010) (10)
Interval underrelaxed bregman's method with an application (1995) (9)
Computing the radius of pointedness of a convex cone (2007) (9)
Normality and modulability indices. Part II (2008) (9)
FOR VARIATIONAL INEQUALITY PROBLEMS (2010) (8)
Antipodality in convex cones and distance to unpointedness (2008) (8)
A regularized dual-based iterative method for a class of image reconstruction problems (1993) (8)
Multiplicative Interior Gradient Methods for Minimization Over theNonnegative Orthant (1996) (8)
A Note on “Existence Results for Noncoercive Mixed Variational Inequalities in Finite Dimensional Spaces” (2019) (8)
Existence results for quasi-equilibrium problems (2014) (8)
Primal-dual row-action method for convex programming (1995) (8)
Convergence Properties of Iterative Methods for Symmetric Positive Semidefinite Linear Complementarity Problems (1993) (8)
Convergence analysis of the extragradient method for equilibrium problems in Hadamard spaces (2020) (8)
An interior point multiplicative method for optimization under positivity constraints (1995) (7)
Dual convergence of the proximal point method with Bregman distances for linear programming (2007) (7)
On the central path for nonlinear semidefinite programming (2000) (7)
First Order Conditions for Ideal Minimization of Matrix-Valued Problems (2003) (7)
Fixed-Point Methods for a Certain Class of Operators (2013) (6)
Enlargements of Monotone Operators (2008) (6)
An extragradient method for vector equilibrium problems on Hadamard manifolds (2021) (6)
Circumcentering approximate reflections for solving the convex feasibility problem (2021) (6)
On the Quadratic Eigenvalue Complementarity Problem over a general convex cone (2015) (6)
Proximal Point Algorithms for Quasiconvex Pseudomonotone Equilibrium Problems (2021) (5)
Fixed points of Legendre-Fenchel type transforms (2017) (5)
On the numerical solution of the quadratic eigenvalue complementarity problem (2016) (5)
Regularity results for semimonotone operators (2011) (5)
A mixed Hölder and Minkowski inequality (1999) (5)
A primal-dual iterative algorithm for a maximum likelihood estimation problem (1992) (5)
Steepest Descent Methods with Generalized Distances for Constrained Optimization (1997) (5)
An alternating direction method of multipliers for the eigenvalue complementarity problem (2020) (4)
On the convergence of SOR- and JOR-type methods for convex linear complementarity problems (1991) (4)
Splitting methods for finding zeroes of sums of maximal monotone operators in Banach spaces (2013) (4)
A proximal method with logarithmic barrier for nonlinear complementarity problems (2016) (4)
The Second-Order Cone Quadratic Eigenvalue Complementarity Problem (2016) (4)
An interior point method for constrained saddle point problems (2004) (4)
An interior point method for the nonlinear complementarity problem (1997) (3)
On mixed Hölder-Minkowski inequalities and total convexity of certain functions in ℒ^p(Ω) (2000) (3)
A circumcentered-reflection method for finding common fixed points of firmly nonexpansive operators (2022) (3)
Continuous optimization: 5th Brazilian workshop (2007) (2)
Nonlinear Proximal Decomposition Method for Convex Programming 1 (1999) (2)
Computation of Fixed Points (2000) (2)
On the centralization of the circumcentered-reflection method (2021) (2)
On OM-decomposable sets (2018) (1)
Primal-dual partitions in linear semi-infinite programming with bounded coefficients (2020) (1)
Consumer behavior and energy demand forecasts for the United States: A synthesis of neoclassical and behavioral approaches using the Stanford Pilot CESM (1984) (1)
An Inexact Modified Subgradient Algorithm for Primal-Dual Problems via Augmented Lagrangians (2012) (1)
Quasiconvex optimization problems and asymptotic analysis in Banach spaces (2020) (1)
Circumcentering approximate reflections for solving the convex feasibility problem (2022) (1)
Convergence analysis of the extragradient method for equilibrium problems in Hadamard spaces (2020) (1)
Concepts and techniques of optimization on the sphere (2014) (1)
The EM algorithm for ill-posed integral equations: a convergence analysis (2007) (1)
On diametrically maximal sets, maximal premonotone operators and premonotone bifunctions (2020) (1)
The effect of calmness on the solution set of systems of nonlinear equations (2011) (0)
On OM-decomposable sets (2017) (0)
Symposium on Convex Optimization and Monotone Operators (2010) (0)
A proximal method with logarithmic barrier for nonlinear complementarity problems (2015) (0)
A characterization of the set of fixed points of some smoothed operators (1992) (0)
Coal module of the PILOT system. Technical report SOL 79-27 (1979) (0)
Fixed-Point Methods for a Certain Class of Operators (2012) (0)
Set Convergence and Point-to-Set Mappings (2008) (0)
CAUCHY TRAJECTORIES IN RIEMANNIAN MANIFOLDS (2007) (0)
Brazilian Data Base for the Global Forest Sector Model (1985) (0)
On the numerical solution of the quadratic eigenvalue complementarity problem (2015) (0)
A new interior point method for the variational inequality problem (1994) (0)
A New Criterion for Optimality in Nonlinear Programming (2012) (0)
Totally Convex Functions (2000) (0)
On the quadratic eigenvalue complementarity problem (2014) (0)
Optimality Conditions for Vector Equilibrium Problems with Applications (2018) (0)
A successive centralized circumcenter reflection method for the convex feasibility problem (2022) (0)
A Strongly Convergent Proximal Point Method for Vector Optimization (2021) (0)
Linear and Nonlinear Programming (2001) (0)
Preface (2016) (0)
Motzkin predecomposable sets (2013) (0)
Preface (2015) (0)
A Levenberg-Marquardt method with approximate projections (2013) (0)
Projections onto convex sets on the sphere (2012) (0)
Consumers energy-services model. Technical report SOL 79-16 (1979) (0)
Infinite Dimensional Optimization (2000) (0)
Convex Analysis and Fixed Point Theorems (2008) (0)
On Diagonal Subdifferential Operators in Nonreflexive Banach Spaces (2011) (0)
Recent Topics in Proximal Theory (2008) (0)
Proximal Point Algorithms for Quasiconvex Pseudomonotone Equilibrium Problems (2021) (0)

This paper list is powered by the following services:

Other Resources About Alfredo Noel Iusem

en.wikipedia.org

What Schools Are Affiliated With Alfredo Noel Iusem?

Alfredo Noel Iusem is affiliated with the following schools: