Displaying similar documents to “A Leontief-type input-output inclusion.”

Asymptotic analysis, existence and sensitivity results for a class of multivalued complementarity problems

Fabián Flores-Bazán, Rubén López (2006)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

In this work we study the multivalued complementarity problem on the non-negative orthant. This is carried out by describing the asymptotic behavior of the sequence of approximate solutions to its multivalued variational inequality formulation. By introducing new classes of multifunctions we provide several existence (possibly allowing unbounded solution set), stability as well as sensitivity results which extend and generalize most of the existing ones in the literature. We also present...

Some new existence, sensitivity and stability results for the nonlinear complementarity problem

Rubén López (2008)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

In this work we study the nonlinear complementarity problem on the nonnegative orthant. This is done by approximating its equivalent variational-inequality-formulation by a sequence of variational inequalities with nested compact domains. This approach yields simultaneously existence, sensitivity, and stability results. By introducing new classes of functions and a suitable metric for performing the approximation, we provide bounds for the asymptotic set of the solution set and coercive...

Global convergence property of modified Levenberg-Marquardt methods for nonsmooth equations

Shou-qiang Du, Yan Gao (2011)

Applications of Mathematics

Similarity:

In this paper, we discuss the globalization of some kind of modified Levenberg-Marquardt methods for nonsmooth equations and their applications to nonlinear complementarity problems. In these modified Levenberg-Marquardt methods, only an approximate solution of a linear system at each iteration is required. Under some mild assumptions, the global convergence is shown. Finally, numerical results show that the present methods are promising.

An analytic center cutting plane algorithm for finding equilibrium points

Fernanda M.P. Raupp, Wilfredo Sosa (2006)

RAIRO - Operations Research

Similarity:

We present a variant of the analytic center cutting plane algorithm proposed by Goffin  (1996) to approximately solve equilibrium problems as proposed by Blum and Oettli (1994), which include as particular problems the variational inequalities problem, the Nash equilibria problem in non-cooperative games, the convex minimization problem, and the fixed point problem. Furthermore, we analyze the convergence and complexity of the modified algorithm.