1.

O. Bahn, B. Büeler, S. Kypreos and H.-J. Luethi, “Modeling an international market of CO2 emission permits,” International Journal Global Energy Issues, submitted 1997.

2.

D. Bertsekas and E. Gafni, “Projection Methods for variational inequalities with applications to the traffic assignment problem,” Mathematical Programming, vol. 17, pp. 139–159, 1982.

3.

B. Büeler, “Computing Economic Equilibria and its Application to International Trade of CO_{2} Permits: An Agent-Based Approach,” Ph.D. thesis, Swiss Federal Institute of Technology, Zürich, Switzerland, December 1997.

4.

S. Choi, W. DeSarbo and P. Harke, “Product positioning under price competitition,” Management Science, vol. 36–2, pp. 175–199, 1990.

5.

J.-P. Crouzeix, “Pseudomontone variational inequality problems: Existence of solutions,” Mathematical Programming, vol. 78, pp. 305–314, 1997.

6.

M. Denault, “Variational Inequalities with Analytic Center Cutting-Plane Methods,” Ph.D. thesis, McGill University, Montréal, Canada, 1998.

7.

S. Dirkse and M. Ferris, “MCPLIB: A collection of nonlinear mixed complementarity problems,” Optimization Methods and Software, vol. 5, pp. 319–345, 1995.

8.

F. Facchinei, A. Fischer and C. Kanzow, “A semismooth Newton method for variational inequalities: the case of box constraints,” in Complementarity and variational problems: State of the art, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, 1997.

9.

M. Ferris and J.-S. Pang, “Complementarity and variational problems: State of the art,” Society for Industrial and Applied Mathematics (SIAM), Philadelphia, 1997.

10.

M. Fukushima, “Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems,” Mathematical Programming, vol. 53, pp. 99–110, 1992.

11.

J.-L. Goffin, A. Haurie and J.-P. Vial, “Decomposition and nondifferentiable optimization with the projective algorithm,” Management Science, vol. 38, pp. 284–302, 1992.

12.

J.-L. Goffin, Z.-Q. Luo and Y. Ye, “Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems,” SIAM Journal on Optimization, vol 6, pp. 638–652, 1996.

13.

J.-L. Goffin, P. Marcotte and D. Zhu, “An analytic center cutting plane method for pseudomonotone variational inequalities,” Operations Research Letters, vol. 20, pp. 1–6, 1997.

14.

J.-L. Goffin and F. Mokhtarian, “Using the primal-dual infeasible Newton method in the analytic center method for problems defined by deep cutting planes,” Journal of Optimization Theory and Applications, vol. 37, pp. 181–210, 1998.

15.

P. Harker, “Accelerating the convergence of the diagonalization and projection algorithms for finite-dimensional variational inequalities,” Mathematical Programming, vol. 41, pp. 29–59, 1988.

16.

P. Harker, “Lectures on Computation of Equilibria with Equation-Based Methods,”, CORE Lecture Series, CORE Foundation, Louvain-la-Neuve, 1993.

17.

P. Harker and J.-S. Pang, “Finite-dimensional variational inequality and nonlinear complementarity problems: a survey of theory, algorithms and applications,” Mathematical Programming, vol. 48(1990), 161–220, 1990.

18.

J. Huang and J.-S. Pang, “Option Pricing and Linear Complementarity,” Journal of Computational Finance, submitted 1997.

19.

P. Jaillet, D. Lamberton, and B. Lapeyre, “Variation Inequalities and the Pricing of American Options,” Acta Applicandae Mathematicae, vol. 21, pp. 263–289, 1990.

20.

C. Kanzow and H.-D. Qi, “A QP-free constrained Newton-type method for variational inequality problems,” Preprint 121, Institute of Applied Mathematics, University of Hamburg, Hamburg, Germany, 1997.

21.

S. Karamardian, “Complementarity problems over cones with monotone and pseudomonotone maps,” Journal of Optimization Theory and Applications, vol. 18, pp. 445–454, 1976.

22.

D. Kinderlehrer and G. Stampacchia, “An Introduction to Variational Inequalities and their applications,” Academic Press, New York, 1980.

23.

I. V. Konnov, “A combined relaxation method for variational inequalties with nonlinear constraints,” Mathematical Programming, vol. 80, pp. 239–252, 1998.

24.

G. M. Korpelevich, “The extragradient method for finding saddle points and other problems,” Matecon, vol. 12, pp. 747–756, 1976.

25.

C. Lemaréchal, A. Nemirovskii and Y. Nesterov, “New Variants of Bundle Methods, ” Mathematical Programming, vol. 69, pp.111–147, 1995.

26.

H.-J. Lüthi, “On the solution of variational inequalities by the ellipsoid method,” Mathematics of Operations Research, vol. 10–3, pp. 515–522, 1985.

27.

T. Magnanti and G. Perakis, “A unifying geometric solution framework and complexity analysis for variational inequalities,” Mathematical Programming, vol. 71, pp. 327–351, 1995.

28.

T. Magnanti and G. Perakis, “Averaging schemes for variational inequalities and systems of equations,” Mathematics of Operations Research, pp. 3–22, pp. 568–587, 1997.

29.

O. Mangasarian, “Equivalence of the complementarity problem to a system of nonlinear equations,” SIAM Journal on Applied Mathematics, vol. 31, pp. 89–92, 1976.

30.

A.S. Manne, “ETA-MACRO: A Model of Energy-Economy Interactions,” in Modeling Energy-Economy Interactions, Resources for the Future, Washington, D.C, 1977.

31.

P. Marcotte, “Inéquations variationnelles: Motivation, algorithmes de résolution et quelques applications,” Centre de Recherche sur les Transports, Publication CRT-97–02, 1997.

32.

L. Mathiesen, “An algorithm based on a sequence of linear complementarity problems applied to a wlarasian equilibrium model: an example,” Mathematical Programming, vol 37, pp. 1–18, 1997.

33.

G. Minty, “Monotone (nonlinear) operators in Hilber space,” Duke Mathematics Journal, vol. 29, pp. 341–346, 1962.

34.

S. Mizuno, “A new polynomial time method for a linear complementarity problem,” Mathematical Programming, vol. 56, pp. 31–43, 1992.

35.

A. Nagurney, “Network Economics: a variational inequality approach,” Kluwer Academic Publishers: Boston, MA, 1993.

36.

Y. Nesterov and A. Nemirovskii, “Interior-Point Polynomial Algorithms in Convex Programming,” SIAM Studies in Applied Mathematics, SIAM: Philadelphia, 1994.

37.

Y. Nesterov and J.-Ph. Vial, “Homogeneous analytic center cutting plane methods for convex problems and variational inequalities,” Logilab Technical Report, 1997.4, 1997.

38.

D. Ralph and S. Wright, “Superlinear convergence of an interior-point method for monotone variational inequalities,” in Complementarity and variational problems: State of the art, Society for Industrial and Applied Mathematics (SIAM): Philadelphia, 1997.

39.

H. Scarf (with the collaboration of T. Hansen), “The Computation of Economic Equilibria,” Yale University Press, 1973.

40.

M. Solodov and P. Tseng, “Modified projection-type methods for monotone variational inequalities,” SIAM Journal on Control and Optimization, vol. 34–5, pp. 1814–1830, 1996.

41.

Gy. Sonnevend, “New algorithms in convex programming based on a notion of “centre” (for systems of analytic inequalities) and on rational extrapolation,” in Trends in Mathematical Optimization, Birkhäuser Verlag, pp. 311–326, 1988.

42.

D. Sun, M. Fukushima and L. Qi, “A computable generalized hessian of the D-gap function and Newton-type methods for variational inequality problems,” in Complementarity and variational problems: State of the art, Society for Industrial and Applied Mathematics (SIAM): Philadelphia, 1997.

43.

R. Tobin, “A variable dimension solution approach for the general spatial price equilibrium problem,” Mathematical Programming, vol. 40, pp. 33–51, 1988.

44.

P. Wilmott, J.N. Dewynne and S.D. Howison, “Option Pricing: Mathematical Models and Computation,” Oxford Financial Press, 1993.

45.

B. Xiao and P. Harker, “A nonsmooth Newton method for variational inequalities, I: theory”, Mathematical Programming, vol. 65, pp. 151–194, 1994.

46.

B. Xiao and P. Harker, “A nonsmooth Newton method for variational inequalities, II: numerical results,” Mathematical Programming, vol. 65, 195–216, 1994.

47.

Y. Ye, “Interior Point Algorithms: Theory and Analysis,” John Wiley and Sons, Inc., 1997.

48.

Y. Zhang, “Solving Large-Scale Linear Programs by Interior-Point Methods Under the MATLAB Environment,” Technical Report TR96–01, University of Maryland Baltimore County, 1996.