Alfredo Noel Iusem

Alfredo Noel Iusem

Auto-generated profile, based on publicly available information

Alfredo Noel Iusem

Fundação Getulio Vargas

Research Focus & Metrics

Academic Career Length

35Years (1992-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2004 in Computational Optimization and Applications
Verified
Journal Article
Closed access
PDF file
LDL.M. Graña Drummond
L.M. Graña Drummond
AIA.N. Iusem
A.N. Iusem

3 May 2007 in Mathematical Programming
Verified
Journal Article
Closed access
PDF file
AIAlfredo N. Iusem
Alfredo N. Iusem
GKGábor Kassay
Gábor Kassay
WSWilfredo Sosa
Wilfredo Sosa

1 October 2010 in Journal of Global Optimization
Verified
Journal Article
Closed access
PDF file
AIAlfredo N. Iusem
Alfredo N. Iusem
MNMostafa Nasri
Mostafa Nasri

1 January 1997 in Optimization
Verified
Journal Article
Closed access
NIN. Alfredo. Iusem
N. Alfredo. Iusem
VSV. Michael. Solodov
V. Michael. Solodov
We consider a class of interior point algorithms for minimizing a twice continuously differentiable function over a closed convex set with nonempty interior. On one hand, our algirothms can be viewed as an approximate version of the generalized proximal point methods and, on the other hand, as an extension of unconstrained Newton-type methods to the constrained case. Each step consists of solving a strongly convex unconstrained program followed by a one-dimensional search along either a line or a curve segment in the interior of the feasible set. The information about the feasible set is contained in the generalized distance function whose gradient diverges on the boundary of this set. When the feasible set is the whole space, the standard regularized Newton method is a particular case in our framework. We show, under standard assumptions, that every accumulation point of the sequence of iterates satisfies a first order necessary optimality condition for the problem and solves the problem if the objective function is convex. Some computational results are also reported

1 January 2003 in Computational and Applied Mathematics
Verified
Journal Article
Open access
PDF file
AIA. N. Iusem
A. N. Iusem
When applied to an unconstrained minimization problem with a convex objective, the steepest descent method has stronger convergence properties than in the noncovex case: the whole sequence converges to an optimal solution under the only hypothesis of existence of minimizers (i.e. without assuming e.g. boundedness of the level sets). In this paper we look at the projected gradient method for constrained convex minimization. Convergence of the whole sequence to a minimizer assuming only existence of solutions has also been already established for the variant in which the stepsizes are exogenously given and square summable. In this paper, we prove the result for the more standard (and also more efficient) variant, namely the one in which the stepsizes are determined through an Armijo search.

5 March 2014 in TOP
Verified
Journal Article
Closed access
PDF file
OFO. P. Ferreira
O. P. Ferreira
AIA. N. Iusem
A. N. Iusem
SNS. Z. Németh
S. Z. Németh