The Hankel transform of an integer sequence (an) is defined as a sequence formed by the determinants of the matrices An, where An is the upper-left submatrix of size nÃ— n of the Hankel matrix A =â€¦ (More)

This paper stresses the role of co-coercivity and related notions in the convergence of iterative schemes for solving monotone, but not necessarily strongly or even strictly monotone variationalâ€¦ (More)

The generalized bilevel programming problem (GBLP) is a bilevel mathematical program where the lower level is a variational inequality. In this paper we prove that if the objective function of a GBLPâ€¦ (More)

Let VIP(F; C) denote the variational inequality problem associated with the mapping F and the closed convex set C. In this paper we introduce weak conditions on the mapping F that allow theâ€¦ (More)

We consider an analytic center algorithm for solving generalized monotone variational inequalities in R", which adapts a recent result due to Goffin et al. (1993) to the numerical resolution ofâ€¦ (More)

In this workwe provide a simple proof of the existence of optimal tolls formulticlass network equilibrium problems where the value-of-time parameter varies continuously throughout the population. Theâ€¦ (More)

In this work we give su cient conditions for the nite convergence of descent algorithms for solving variational inequalities involving generalized monotone mappings.

The descent auxiliary problem method allows one to nd the solution of minimization problems by solving a sequence of auxiliary problems which incorporate a linesearch strategy. We derive the basicâ€¦ (More)