default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlfredo N. Iusem
Person information
- affiliation: Instituto Nacional de Matemãtica Pura e Aplicada, Rio de Janeiro, Brazil
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j62]Roger Behling
, Yunier Bello-Cruz, Alfredo N. Iusem, Di Liu, Luiz-Rafael Santos:
A successive centralized circumcentered-reflection method for the convex feasibility problem. Comput. Optim. Appl. 87(1): 83-116 (2024)- [j61]Alfredo Noel Iusem, Felipe Lara, Raul Tintaya Marcavillaca, Le Hai Yen:
A Two-Step Proximal Point Algorithm for Nonconvex Equilibrium Problems with Applications to Fractional Programming. J. Glob. Optim. 90(3): 755-779 (2024) - [j60]Roger Behling, Yunier Bello-Cruz, Alfredo N. Iusem, Luiz-Rafael Santos:
On the centralization of the circumcentered-reflection method. Math. Program. 205(1): 337-371 (2024) - [j59]Roger Behling, Yunier Bello-Cruz, Alfredo N. Iusem, Di Liu, Luiz-Rafael Santos:
A Finitely Convergent Circumcenter Method for the Convex Feasibility Problem. SIAM J. Optim. 34(3): 2535-2556 (2024) - 2022
- [j58]Alfredo N. Iusem, Felipe Lara:
Proximal Point Algorithms for Quasiconvex Pseudomonotone Equilibrium Problems. J. Optim. Theory Appl. 193(1): 443-461 (2022) - 2021
- [j57]Reza Arefidamghani, Roger Behling, José Yunier Bello Cruz, Alfredo N. Iusem, Luiz-Rafael Santos:
The circumcentered-reflection method achieves better rates than alternating projections. Comput. Optim. Appl. 79(2): 507-530 (2021) - [j56]Alfredo N. Iusem, Jefferson G. Melo, Ray G. Serra:
A Strongly Convergent Proximal Point Method for Vector Optimization. J. Optim. Theory Appl. 190(1): 183-200 (2021) - [j55]Joaquim João Júdice, Masao Fukushima, Alfredo N. Iusem, José Mario Martínez, Valentina Sessa:
An alternating direction method of multipliers for the eigenvalue complementarity problem. Optim. Methods Softw. 36(2-3): 337-370 (2021) - 2020
- [j54]Alfredo N. Iusem, Vahid Mohebbi:
Convergence analysis of the extragradient method for equilibrium problems in Hadamard spaces. Comput. Appl. Math. 39(2) (2020) - [j53]Alfredo Noel Iusem, Felipe Lara:
A Note on "Existence Results for Noncoercive Mixed Variational Inequalities in Finite Dimensional Spaces". J. Optim. Theory Appl. 187(2): 607-608 (2020)
2010 – 2019
- 2019
- [j52]Alfredo N. Iusem, Felipe Lara:
Optimality Conditions for Vector Equilibrium Problems with Applications. J. Optim. Theory Appl. 180(1): 187-206 (2019) - [j51]Alfredo N. Iusem, Felipe Lara:
Existence Results for Noncoercive Mixed Variational Inequalities in Finite Dimensional Spaces. J. Optim. Theory Appl. 183(1): 122-138 (2019) - [j50]Alfredo N. Iusem, Alejandro Jofré, Philip Thompson:
Incremental Constraint Projection Methods for Monotone Stochastic Variational Inequalities. Math. Oper. Res. 44(1): 236-263 (2019) - [j49]Alfredo N. Iusem, Joaquim João Júdice, Valentina Sessa, Paula Sarabando:
Splitting methods for the Eigenvalue Complementarity Problem. Optim. Methods Softw. 34(6): 1184-1212 (2019) - [j48]Alfredo N. Iusem, Alejandro Jofré, Roberto I. Oliveira, Philip Thompson:
Variance-Based Extragradient Methods with Line Search for Stochastic Variational Inequalities. SIAM J. Optim. 29(1): 175-206 (2019) - 2017
- [j47]Alfredo N. Iusem, Alejandro Jofré, Roberto Imbuzeiro Oliveira, Philip Thompson:
Extragradient Method with Variance Reduction for Stochastic Variational Inequalities. SIAM J. Optim. 27(2): 686-724 (2017) - 2016
- [j46]Nicolas Hadjisavvas, Alfredo N. Iusem, Boris S. Mordukhovich:
Preface. J. Glob. Optim. 64(4): 621-622 (2016) - [j45]Rolando Gárciga Otero, Alfredo Noel Iusem:
A proximal method with logarithmic barrier for nonlinear complementarity problems. J. Glob. Optim. 64(4): 663-678 (2016) - [j44]Carmo P. Brás, Alfredo N. Iusem, Joaquim Júdice:
On the quadratic eigenvalue complementarity problem. J. Glob. Optim. 66(2): 153-171 (2016) - [j43]Alfredo N. Iusem, Joaquim João Júdice, Valentina Sessa, Hanif D. Sherali:
On the numerical solution of the quadratic eigenvalue complementarity problem. Numer. Algorithms 72(3): 721-747 (2016) - 2015
- [j42]Carmo P. Brás, Masao Fukushima, Alfredo N. Iusem, Joaquim João Júdice:
On the Quadratic Eigenvalue Complementarity Problem over a general convex cone. Appl. Math. Comput. 271: 594-608 (2015) - [j41]José Yunier Bello Cruz, Alfredo N. Iusem:
Full convergence of an approximate projection method for nonsmooth variational inequalities. Math. Comput. Simul. 114: 2-13 (2015) - 2014
- [j40]Roger Behling, Andreas Fischer, Markus Herrich, Alfredo N. Iusem, Yinyu Ye:
A Levenberg-Marquardt method with approximate projections. Comput. Optim. Appl. 59(1-2): 5-26 (2014) - [j39]Alfredo N. Iusem, J. E. Martínez-Legaz, Maxim I. Todorov:
Motzkin predecomposable sets. J. Glob. Optim. 60(4): 635-647 (2014) - [j38]Luís M. Fernandes, Joaquim Júdice, Masao Fukushima, Alfredo N. Iusem:
On the symmetric quadratic eigenvalue complementarity problem. Optim. Methods Softw. 29(4): 751-770 (2014) - 2013
- [j37]Orizon Pereira Ferreira, Alfredo N. Iusem, Sándor Zoltán Németh:
Projections onto convex sets on the sphere. J. Glob. Optim. 57(3): 663-676 (2013) - [j36]Regina Sandra Burachik, Alfredo N. Iusem, Jefferson G. Melo:
An Inexact Modified Subgradient Algorithm for Primal-Dual Problems via Augmented Lagrangians. J. Optim. Theory Appl. 157(1): 108-131 (2013) - [j35]Rolando Gárciga Otero, Alfredo N. Iusem:
Fixed-Point Methods for a Certain Class of Operators. J. Optim. Theory Appl. 159(3): 656-672 (2013) - [j34]Roger Behling, Alfredo N. Iusem:
The effect of calmness on the solution set of systems of nonlinear equations. Math. Program. 137(1-2): 155-165 (2013) - 2011
- [j33]Alfredo N. Iusem, Mostafa Nasri:
Korpelevich's method for variational inequality problems in Banach spaces. J. Glob. Optim. 50(1): 59-76 (2011) - 2010
- [j32]José Yunier Bello Cruz, Alfredo N. Iusem:
Convergence of direct methods for paramonotone variational inequalities. Comput. Optim. Appl. 46(2): 247-263 (2010) - [j31]Regina Sandra Burachik, Alfredo N. Iusem, Jefferson G. Melo:
A primal dual modified subgradient algorithm with sharp Lagrangian. J. Glob. Optim. 46(3): 347-361 (2010) - [j30]Regina Sandra Burachik, Alfredo N. Iusem, Jefferson G. Melo:
Duality and Exact Penalization for General Augmented Lagrangians. J. Optim. Theory Appl. 147(1): 125-140 (2010) - [j29]Alfredo N. Iusem, Mostafa Nasri:
Augmented Lagrangian methods for variational inequality problems. RAIRO Oper. Res. 44(1): 5-25 (2010)
2000 – 2009
- 2009
- [j28]Alfredo N. Iusem, Gábor Kassay, Wilfredo Sosa:
On certain conditions for the existence of solutions of equilibrium problems. Math. Program. 116(1-2): 259-273 (2009) - [j27]Alfredo N. Iusem, Alberto Seeger:
Searching for critical angles in a convex cone. Math. Program. 120(1): 3-25 (2009) - 2008
- [j26]Alfredo N. Iusem, Alberto Seeger:
Antipodality in convex cones and distance to unpointedness. Appl. Math. Lett. 21(10): 1018-1023 (2008) - [j25]Kurt M. Anstreicher, Alfredo N. Iusem:
Continuous optimization: 5th Brazilian workshop. Math. Program. 111(1-2): 1-4 (2008) - [j24]Alfredo N. Iusem, Alberto Seeger:
Computing the radius of pointedness of a convex cone. Math. Program. 111(1-2): 217-241 (2008) - [j23]Alfredo N. Iusem, Abilio Lucena, Nelson Maculan:
Preface. Math. Program. 112(1): 1 (2008) - [j22]Alfredo N. Iusem, Alberto Seeger:
Antipodal pairs, critical pairs, and Nash angular equilibria in convex cones. Optim. Methods Softw. 23(1): 73-93 (2008) - 2007
- [j21]João Xavier da Cruz Neto, Orizon Pereira Ferreira, Alfredo N. Iusem, Renato D. C. Monteiro:
Dual convergence of the proximal point method with Bregman distances for linear programming. Optim. Methods Softw. 22(2): 339-360 (2007) - 2005
- [j20]Alfredo N. Iusem, Alberto Seeger:
On pairs of vectors achieving the maximal angle of a convex cone. Math. Program. 104(2-3): 501-523 (2005) - [j19]Henri Bonnel, Alfredo N. Iusem, Benar Fux Svaiter:
Proximal Methods in Vector Optimization. SIAM J. Optim. 15(4): 953-970 (2005) - 2004
- [j18]L. Mauricio Graña Drummond, Alfredo N. Iusem:
A Projected Gradient Method for Vector Optimization Problems. Comput. Optim. Appl. 28(1): 5-29 (2004) - 2003
- [j17]Alfredo N. Iusem, Teemu Pennanen, Benar Fux Svaiter:
Inexact Variants of the Proximal Point Algorithm without Monotonicity. SIAM J. Optim. 13(4): 1080-1097 (2003) - 2001
- [j16]O. Rolando Gárciga, Alfredo N. Iusem, Benar Fux Svaiter:
On the need for hybrid steps in hybrid proximal point methods. Oper. Res. Lett. 29(5): 217-220 (2001) - 2000
- [j15]Dan Butnariu, Alfredo N. Iusem, Regina Sandra Burachik:
Iterative Methods of Solving Stochastic Convex Feasibility Problems and Applications. Comput. Optim. Appl. 15(3): 269-307 (2000) - [j14]Alfredo N. Iusem, Renato D. C. Monteiro:
On Dual Convergence of the Generalized Proximal Point Method with Bregman Distances. Math. Oper. Res. 25(4): 606-624 (2000) - [j13]L. Mauricio Graña Drummond, Alfredo Noel Iusem, Benar Fux Svaiter:
On the central path for nonlinear semidefinite programming. RAIRO Oper. Res. 34(3): 331-345 (2000)
1990 – 1999
- 1999
- [j12]Regina Sandra Burachik, Alfredo N. Iusem:
A generalized proximal point algorithm for the nonlinear complementarity problem. RAIRO Oper. Res. 33(4): 447-479 (1999) - 1998
- [j11]Ya. I. Alber, Alfredo N. Iusem, Mikhail V. Solodov:
On the projected subgradient method for nonsmooth convex optimization in a Hilbert space. Math. Program. 81: 23-35 (1998) - [j10]Yair Censor, Alfredo N. Iusem, Stavros A. Zenios:
An interior point method with Bregman functions for the variational inequality problem with paramonotone operators. Math. Program. 81: 373-400 (1998) - [j9]Regina Sandra Burachik, Alfredo N. Iusem:
A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space. SIAM J. Optim. 8(1): 197-216 (1998) - 1995
- [j8]Alfredo N. Iusem, Marc Teboulle:
Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming. Math. Oper. Res. 20(3): 657-677 (1995) - 1994
- [j7]Alfredo N. Iusem, Benar Fux Svaiter, Marc Teboulle:
Entropy-Like Proximal Methods in Convex Programming. Math. Oper. Res. 19(4): 790-814 (1994) - [j6]Alfredo N. Iusem, Benar Fux Svaiter:
A row-action method for convex programming. Math. Program. 64: 149-171 (1994) - 1993
- [j5]Alvaro R. De Pierro, Alfredo N. Iusem:
Convergence Properties of Iterative Methods for Symmetric Positive Semidefinite Linear Complementarity Problems. Math. Oper. Res. 18(2): 317-333 (1993) - [j4]Alfredo N. Iusem:
On the convergence of iterative methods for symmetric linear complementarity problems. Math. Program. 59: 33-48 (1993) - 1991
- [j3]Alfredo N. Iusem, Alvaro R. De Pierro:
On the convergence of Han's method for convex programming with quadratic objective. Math. Program. 52: 265-284 (1991) - [j2]Alfredo N. Iusem:
On Dual Convergence and the Rate of Primal Convergence of Bregman's Convex Programming Method. SIAM J. Optim. 1(3): 401-423 (1991) - 1990
- [j1]Alfredo N. Iusem, Alvaro R. De Pierro:
On the Convergence Properties of Hildreth's Quadratic Programming Algorithm. Math. Program. 47: 37-51 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:36 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
