zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications. (English) Zbl 0734.90098
Summary: Over the past decade, the field of finite-dimensional variational inequality and complementarity problems has seen a rapid development in its theory of existence, uniqueness and sensitivity of solution(s), in the theory of algorithms, and in the application of these techniques to transportation planning, regional science, socio-economic analysis, energy modelling, and game theory. This paper provides a state-of-the-art review of these developments as well as a summary of some open research topics in this growing field.

MSC:
90C33Complementarity and equilibrium problems; variational inequalities (finite dimensions)
90-02Research monographs (optimization)
49J40Variational methods including variational inequalities
91B50General equilibrium theory in economics
91D25Spatial models (mathematical sociology)
91A10Noncooperative games
Software:
PITCON
References:
[1]H.Z. Aashtiani and T.L. Magnanti, ”Equilibria on a congested transportation network,”SIAM Journal on Algebraic and Discrete Methods 2 (1981) 213–226. · Zbl 0501.90033 · doi:10.1137/0602024
[2]H.Z. Aashtiani and T.L. Magnanti, ”A linearization and decomposition algorithm for computing urban traffic equilibria,”Proceedings of the 1982IEEE International Large Scale Systems Symposium (1982) 8–19.
[3]M. Abdulaal and L.J. LeBlanc, ”Continuous equilibrium network design models,”Transportation Research 13B (1979) 19–32.
[4]M. Aganagic, ”Variational inequalities and generalized complementarity problems,” Technical Report SOL 78-11, Systems Optimization Laboratory, Department of Operations Research, Stanford University (Stanford, CA 1978).
[5]B.H. Ahn,Computation of Market Equilibria for Policy Analysis: The Project Independence Evaluation Study (PIES) Approach (Garland, NY, 1979).
[6]B.H. Ahn, ”A Gauss-Seidel iteration method for nonlinear variational inequality problems over rectangles,”Operations Research Letters 1 (1982) 117–120. · Zbl 0488.90066 · doi:10.1016/0167-6377(82)90011-6
[7]B.H. Ahn, ”A parametric network method for computing nonlinear spatial equilibria,” Research report, Department of Management Science, Korea Advanced Institute of Science and Technology (Seoul, Korea, 1984).
[8]B.H. Ahn and W.W. Hogan, ”On convergence of the PIES algorithm for computing equilibria,”Operations Research 30 (1982) 281–300. · Zbl 0481.90011 · doi:10.1287/opre.30.2.281
[9]E. Allgower and K. Georg, ”Simplicial and continuation methods for approximating fixed points and solutions to systems of equations,”SIAM Review 22 (1980) 28–85. · Zbl 0432.65027 · doi:10.1137/1022003
[10]R. Asmuth, ”Traffic network equilibrium,” Technical Report SOL 78-2, Systems Optimization Laboratory, Department of Operations Research, Stanford University (Stanford, CA, 1978).
[11]R. Asmuth, B.C. Eaves and E.L. Peterson, ”Computing economic equilibria on affine networks with Lemke’s algorithm,”Mathematics of Operations Research 4 (1979) 207–214. · Zbl 0443.90027 · doi:10.1287/moor.4.3.209
[12]J.P. Aubin,Mathematical Methods of Game and Economic Theory (North-Holland, Amsterdam, 1979).
[13]M. Avriel,Nonlinear Programming: Analysis and Methods (Prentice-Hall, Englewood Cliffs, NJ, 1976).
[14]S.A. Awoniyi and M.J. Todd, ”An efficient simplicial algorithm for computing a zero of a convex union of smooth functions,”Mathematical Programming 25 (1983) 83–108. · Zbl 0493.90074 · doi:10.1007/BF02591720
[15]C. Baiocchi and A. Capelo,Variational and Quasivariational Inequalities: Application to Free-Boundary Problems (Wiley, New York, 1984).
[16]B. Banks, J. Guddat, D. Klatte, B. Kummer and K. Tammer,Nonlinear Parametric Optimization (Birkhauser, Basel, 1983).
[17]V. Barbu,Optimal Control of Variational Inequalities (Pitman Advanced Publishing Program, Boston, 1984).
[18]M.J. Beckman, C.B. McGuire, and C.B. Winston,Studies in the Economics of Transportation (Yale University Press, New Haven, CT, 1956).
[19]A. Bensoussan, ”Points de Nash dans le cas de fonctionnelles quadratiques et jeux differentials linéaires aN personnes,”SIAM Journal on Control 12 (1974) 460–499. · Zbl 0286.90066 · doi:10.1137/0312037
[20]A. Bensoussan, M. Goursat and J.L. Lions, ”Contrôle impulsionnel et inéquations quasivariationnelles stationnaires,”Comptes Rendus Academie Sciences Paris 276 (1973) 1279–1284.
[21]A. Bensoussan and J.L. Lions, ”Nouvelle formulation de problèmes de contrôle impulsionnel et applications,”Comptes Rendus Academie Sciences Paris 276 (1973) 1189–1192.
[22]A. Bensoussan and J.L. Lions, ”Nouvelles méthodes en contrôle impulsionnel,”Applied Mathematics and Optimization 1 (1974) 289–312.
[23]C. Berge,Topological Spaces (Oliver and Boyd, Edinburgh, Scotland, 1963).
[24]D.P. Bertsekas and E.M. Gafni, ”Projection methods for variational inequalities with application to the traffic assignment problem,”Mathematical Programming Study 17 (1982) 139–159.
[25]K.C. Border,Fixed Point Theorems with Applications to Economics and Game Theory (Cambridge University Press, Cambridge, 1985).
[26]F.E. Browder, ”Existence and approximation of solutions of nonlinear variational inequalities,”Proceeding of the National Academy of Sciences, U.S.A. 56 (1966) 1080–1086. · Zbl 0148.13502 · doi:10.1073/pnas.56.4.1080
[27]M. Carey, ”Integrability and mathematical programming models: a survey and parametric approach,”Econometrica 45 (1977) 1957–1976. · Zbl 0369.90009 · doi:10.2307/1914120
[28]D. Chan and J.S. Pang, ”The generalized quasi-variational inequality problem,”Mathematics of Operations Research 7 (1982) 211–222. · Zbl 0502.90080 · doi:10.1287/moor.7.2.211
[29]G.S. Chao and T.L. Friesz, ”Spatial price equilibrium sensitivity analysis,”Transportation Research 18B (1984) 423–440.
[30]S.C. Choi, W.S. DeSarbo and P.T. Harker, ”Product positioning under price competition,”Management Science 36 (1990) 265–284. · Zbl 0703.90054 · doi:10.1287/mnsc.36.2.175
[31]R.W. Cottle,Nonlinear Programs with Positively Bounded Jacobians. Ph.D. dissertation, Department of Mathematics, University of California (Berkeley, CA, 1964).
[32]R.W. Cottle, ”Nonlinear programs with positively bounded Jacobians,”SIAM Journal on Applied Mathematics 14 (1966) 147–158. · Zbl 0158.18903 · doi:10.1137/0114012
[33]R.W. Cottle, ”Complementarity and variational problems,”Symposia Mathematica XIX (1976) 177–208.
[34]R.W. Cottle and G.B. Dantzig, ”Complementary pivot theory of mathematical programming,”Linear Algebra and Its Applications 1 (1968) 103–125. · Zbl 0155.28403 · doi:10.1016/0024-3795(68)90052-9
[35]R.W. Cottle, F. Giannessi and J.L. Lions, eds.,Variational Inequalities and Complementarity Problems: Theory and Applications (Wiley, New York, 1980).
[36]R.W. Cottle, G.J. Habetler and C.E. Lemke, ”Quadratic forms semi-definite over convex cones,” in: H.W. Kuhn, ed.,Proceedings of the Princeton Symposium on Mathematical Programming (Princeton University Press, Princeton, NJ, 1970) 551–565.
[37]R.W. Cottle, J.S. Pang and V. Venkateswaran, ”Sufficient matrices and the linear complementarity problem,”Linear Algebra and its Applications 114/115 (1989) 231–249. · Zbl 0674.90092 · doi:10.1016/0024-3795(89)90463-1
[38]R.W. Cottle and A.F. Veinott, Jr., ”Polyhedral sets having a least element,”Mathematical Programming 3 (1972) 238–249. · Zbl 0245.90015 · doi:10.1007/BF01584992
[39]S. Dafermos, ”Traffic equilibria and variational inequalities,”Transportation Science 14 (1980) 42–54. · doi:10.1287/trsc.14.1.42
[40]S. Dafermos, ”The general multimodal network equilibrium problem with elastic demand,”Networks 12 (1982) 57–72. · Zbl 0478.90022 · doi:10.1002/net.3230120105
[41]S. Dafermos, ”Relaxation algorithms for the general asymmetric traffic equilibrium problem,”Transportation Science 16 (1982) 231–240. · doi:10.1287/trsc.16.2.231
[42]S. Dafermos, ”An iterative scheme for variational inequalities,”Mathematical Programming 26 (1983) 40–47. · Zbl 0506.65026 · doi:10.1007/BF02591891
[43]S. Dafermos, ”Sensitivity analysis in variational inequalities,”Mathematics of Operations Research 13 (1988) 421–434. · Zbl 0674.49007 · doi:10.1287/moor.13.3.421
[44]S. Dafermos and A. Nagurney, ”Sensitivity analysis for the general spatial economic equilibrium problem,”Operations Research 32 (1984) 1069–1086. · Zbl 0562.90009 · doi:10.1287/opre.32.5.1069
[45]S. Dafermos and A. Nagurney, ”Sensitivity analysis for the asymmetric network equilibrium problem,”Mathematical Programming 28 (1984) 174–184. · Zbl 0535.90038 · doi:10.1007/BF02612357
[46]J.E. Dennis Jr. and R.B. Schnabel,Numerical Methods for Unconstrained Optimization and Nonlinear Equations (Prentice-Hall, Englewood Cliffs, NJ, 1983).
[47]I.C. Dolcetta and U. Mosco, ”Implicit complementarity problems and quasi-variational inequalities,” in: R.W. Cottle, F. Giannessi and J.L. Lions, eds.,Variational Inequalities and Complementarity Problems: Theory and Applications (Wiley, New York, 1980) 75–87.
[48]B.C. Eaves, ”On the basic theorem of complementarity,”Mathematical Programming 1 (1971) 68–75. · Zbl 0227.90044 · doi:10.1007/BF01584073
[49]B.C. Eaves, ”The linear complementarity problem,”Management Science 17 (1971) 612–634. · Zbl 0228.15004 · doi:10.1287/mnsc.17.9.612
[50]B.C. Eaves, ”Homotopies for computation of fixed points,”Mathematical Programming 3 (1972) 1–22. · Zbl 0276.55004 · doi:10.1007/BF01584975
[51]B.C. Eaves, ”A short course in solving equations with PL homotopies,” in: R.W. Cottle and C.E. Lemke eds.,Nonlinear Programming: SIAM-AMS Proceedings 9 (American Mathematical Society, Providence, RI, 1976) pp. 73–143.
[52]B.C. Eaves, ”Computing stationary points,”Mathematical Programming Study 7 (1978) 1–14.
[53]B.C. Eaves, ”Computing stationary points, again,” in: O.L. Mangasarian, R.R. Meyer and S.M. Robinson, eds.,Nonlinear Programming 3 (Academic Press, New York, 1978) pp. 391–405.
[54]B.C. Eaves, ”Where solving for stationary points by LCPs is mixing Newton iterates,” in: B.C. Eaves, F.J. Gould, H.O. Peitgen and M.J. Todd, eds.,Homotopy Methods and Global Convergence (Plenum Press, New York, 1983) pp. 63–78.
[55]B.C. Eaves, ”Thoughts on computing market equilibrium with SLCP,” Technical Report, Department of Operations Research, Stanford University (Stanford, CA, 1986).
[56]S.C. Fang,Generalized Variational Inequality, Complementarity and Fixed Point Problems: Theory and Application. Ph.D. dissertation, Northwestern University (Evanston, IL, 1979).
[57]S.C. Fang, ”An iterative method for generalized complementarity problems,”IEEE Transactions on Automatic Control AC-25 (1980) 1225–1227.
[58]S.C. Fang, ”Traffic equilibria on multiclass user transportation networks analyzed via variational inequalities,”Tamkang Journal of Mathematics 13 (1982) 1–9.
[59]S.C. Fang, ”Fixed point models for the equilibrium problems on transportation networks,”Tamkang Journal of Mathematics 13 (1982) 181–191.
[60]S.C. Fang, ”A linearization method for generalized complementarity problems,”IEEE Transactions on Automatic Control AC 29 (1984) 930–933. · Zbl 0544.90095 · doi:10.1109/TAC.1984.1103393
[61]S.C. Fang and E.L. Peterson, ”Generalized variational inequalities,”Journal of Optimization Theory and Application 38 (1982) 363–383. · Zbl 0471.49007 · doi:10.1007/BF00935344
[62]S.C. Fang and E.L. Peterson, ”General network equilibrium analysis,”International Journal of Systems Sciences 14 (1983) 1249–1257. · Zbl 0523.90040 · doi:10.1080/00207728308926527
[63]S.C. Fang and E.L. Peterson, ”An economic equilibrium model on a multicommodity network,”International Journal of Systems Sciences 16 (1985) 479–490. · Zbl 0573.90012 · doi:10.1080/00207728508926688
[64]A.V. Fiacco,Introduction to Sensitivity and Stability Analysis in Nonlinear Programming (Academic Press, New York, 1983).
[65]A.V. Fiacco and J. Kyparisis, ”Sensitivity analysis in nonlinear programming under second order assumptions,” in: A. Bagchi and H. Th. Jongen, eds.,Systems and Optimization (Springer, Berlin, 1985) pp. 74–97.
[66]M. Fiedler and V. Ptak, ”On matrices with nonpositive off-diagonal elements and positive principal minors,”Czechoslovak Mathematics Journal 12 (1962), 382–400.
[67]M.L. Fisher and F.J. Gould, ”A simplicial algorithm for the nonlinear complementarity problem,”Mathematical Programming 6 (1974) 281–300. · Zbl 0291.90058 · doi:10.1007/BF01580246
[68]M.L. Fisher and J.W. Tolle, ”The nonlinear complementarity problem: existence and determination of solutions,”SIAM Journal of Control and Optimization 15 (1977), 612–623. · Zbl 0361.90064 · doi:10.1137/0315039
[69]C.S. Fisk and D.E. Boyce, ”Alternative variational inequality formulations of the network equilibrium–travel choice problem,”Transportation Science 17 (1983) 454–463. · doi:10.1287/trsc.17.4.454
[70]C.S. Fisk and S. Nguyen, ”Solution algorithms for network equilibrium models with asymmetric user costs,”Transportation Science 16 (1982) 316–381. · doi:10.1287/trsc.16.3.361
[71]M. Florian, ed.,Traffic Equilibrium Methods (Springer, Berlin, 1976).
[72]M. Florian, ”Nonlinear cost network models in transportation analysis,”Mathematical Programming Study 26 (1986) 167–196.
[73]M. Florian and M. Los, ”A new look at static spatial price equilibrium models,”Regional Science and Urban Economics 12 (1982) 579–597. · doi:10.1016/0166-0462(82)90008-4
[74]M. Florian and H. Spiess, ”The convergence of diagonalization algorithms for asymmetric network equilibrium problems,”Transportation Research 16B (1982) 447–483.
[75]T.L. Friesz, ”Network equilibrium, design and aggregation,”Transportation Research 19A (1985) 413–427.
[76]T.L. Friesz, R.L. Tobin, T.E. Smith and P.T. Harker, ”A nonlinear complementary formulation and solution procedure for the general derived demand network equilibrium problem,”Journal of Regional Science 23 (1983) 337–359. · doi:10.1111/j.1467-9787.1983.tb00994.x
[77]T.L. Friesz and P.T. Harker, ”Freight network equilibrium: a review of the state of the art,” in: A. Daughety, ed.,Analytical Studies in Transportation Economics (Cambridge University Press, Cambridge, 1985) 161–206.
[78]T.L. Friesz, P.T. Harker and R.L. Tobin, ”Alternative algorithms for the general network spatial price equilibrium problem,”Journal of Regional Science 24 (1984) 473–507. · doi:10.1111/j.1467-9787.1984.tb01043.x
[79]M. Fukushima, ”A relaxed projection method for variational inequalities,”Mathematical Programming 35 (1986) 58–70. · Zbl 0598.49024 · doi:10.1007/BF01589441
[80]D. Gabay and H. Moulin, ”On the uniqueness and stability of Nash-equilibria in noncooperative games,” in: A. Bensoussan, P. Kleindorfer and C.S. Tapiero, eds.,Applied Stochastic Control in Econometrics and Management Science (North-Holland, Amsterdam, 1980) pp. 271–292.
[81]C.B. Garcia and W.I. Zangwill,Pathways to Solutions, Fixed Points and Equilibria (Prentice-Hall, Englewood Cliffs, NJ, 1981).
[82]R. Glowinski, J.L. Lions and R. Trémolières,Analyses Numérique des Inéquations Variationalles: Methodes Mathematiques de l’Informatique (Dunod, Paris, 1976).
[83]C.D. Ha, ”Application of degree theory in stability of the complementarity problem,”Mathematics of Operations Research 12 (1987) 368–376. · Zbl 0616.90082 · doi:10.1287/moor.12.2.368
[84]G.J. Habetler and M.M. Kostreva, ”On a direct algorithm for nonlinear complementarity problems,”SIAM Journal of Control and Optimization 16 (1978) 504–511. · Zbl 0392.90083 · doi:10.1137/0316033
[85]G.J. Habetler and A.L. Price, ”Existence theory for generalized nonlinear complementarity problems,”Journal of Optimization Theory and Applications 7 (1971) 223–239. · Zbl 0212.24001 · doi:10.1007/BF00928705
[86]J.H. Hammond,Solving Asymmetric Variational Inequality Problems and Systems of Equation with Generalized Nonlinear Programming Algorithms. Ph.D. dissertation, Department of Mathematics, M.I.T. (Cambridge, MA, 1984).
[87]J.H. Hammond and T.L. Magnanti, ”Generalized descent methods for asymmetric systems of equations,”Mathematics of Operations Research 12 (1987) 678–699. · Zbl 0642.65035 · doi:10.1287/moor.12.4.678
[88]J.H. Hammond and T.L. Magnanti, ”A contracting ellipsoid method for variational inequality problems,” Working Paper OR 160-87, Operations Research Center, M.I.T. (Cambridge, MA, 1987).
[89]T.H. Hansen,On the Approximation of a Competitive Equilibrium. Ph.D. dissertation, Department of Economics, Yale University (New Haven, CT, 1968).
[90]T.H. Hansen and H. Scarf, ”On the approximation of Nash equilibrium points in an N-person noncooperative game,”SIAM Journal of Applied Mathematics 26 (1974) 622–637. · Zbl 0279.90046 · doi:10.1137/0126058
[91]P.T. Harker, ”A variational inequality approach for the determination of oligopolistic market equilibrium,”Mathematical Programming 30 (1984) 105–111. · Zbl 0559.90015 · doi:10.1007/BF02591802
[92]P.T. Harker, ”A generalized spatial price equilibrium model,”Papers of the Regional Science Association 54 (1984) 25–42. · doi:10.1007/BF01940123
[93]P.T. Harker, ed.,Spatial Price Equilibrium: Advances in Theory, Computation and Application. Lecture Notes in Economics and Mathematical Systems, Vol 249 (Springer, Berlin, 1985).
[94]P.T. Harker, ”Existence of competitive equilibria via Smith’s nonlinear complementarity result,”Economics Letters 19 (1985) 1–4. · Zbl 1273.91273 · doi:10.1016/0165-1765(85)90090-4
[95]P.T. Harker, ”Alternative models of spatial competition,”Operations Research 34 (1986) 410–425. · Zbl 0602.90018 · doi:10.1287/opre.34.3.410
[96]P.T. Harker, ”A note on the existence of traffic equilibria,”Applied Mathematics and Computation 18 (1986) 277–283. · Zbl 0597.90031 · doi:10.1016/0096-3003(86)90001-9
[97]P.T. Harker,Predicting Intercity Freight Flows (VNU Science Press, Utrecht, The Netherlands, 1987).
[98]P.T. Harker, ”Multiple equilibria behaviors on networks,”Transportation Science 22 (1988), 39–46. · Zbl 0638.90040 · doi:10.1287/trsc.22.1.39
[99]P.T. Harker, ”Accelerating the convergence of the diagonalization and projection algorithms for finite-dimensional variational inequalities,”Mathematical Programming 41 (1988) 29–59. · Zbl 0825.49019 · doi:10.1007/BF01580752
[100]P.T. Harker, ”The core of a spatial price equilibrium game,”Journal of Regional Science 27 (1987) 369–389. · doi:10.1111/j.1467-9787.1987.tb01168.x
[101]P.T. Harker, ”Privatization of urban mass transportation: application of computable equilibrium models for network competition,”Transportation Science 22 (1988) 96–111. · doi:10.1287/trsc.22.2.96
[102]P.T. Harker, ”Generalized Nash games and quasivariational inequalities,” to appear in:European Journal of Operational Research.
[103]P.T. Harker and S.C. Choi, ”A penalty function approach for mathematical programs with variational inequality constraints,” Working paper 87-09-08, Department of Decision Sciences, University of Pennsylvania (Philadelphia, PA, 1987).
[104]P.T. Harker and J.S. Pang, ”Existence of optimal solutions to mathematical programs with equilibrium constraints,”Operations Research Letters 7 (1988) 61–64. · Zbl 0648.90065 · doi:10.1016/0167-6377(88)90066-1
[105]P.T. Harker and J.S. Pang, ”A damped-Newton method for the linear complementarity problem,” in: E.L. Allgower and K. Georg, eds.,Computational Solution of Nonlinear Systems of Equations. AMS Lectures on Applied Mathematics 26 (1990) 265–284.
[106]P.T. Harker and J.S. Pang,Equilibrium Modeling With Variational Inequalities: Theory, Computation and Application, in preparation.
[107]P. Hartman and G. Stampacchia, ”On some nonlinear elliptic differential functional equations,”Acta Mathematica 115 (1966) 153–188. · Zbl 0142.38102 · doi:10.1007/BF02392210
[108]A. Haurie and P. Marcotte, ”On the relationship between Nash-Cournot and Wardrop equilibria,”Networks 15 (1985) 295–308. · Zbl 0579.90030 · doi:10.1002/net.3230150303
[109]A. Haurie and P. Marcotte, ”A game-theoretic approach to network equilibrium,”Mathematical Programming Study 26 (1986) 252–255.
[110]A. Haurie, G. Zaccour, J. Legrand and Y. Smeers, ”A stochastic dynamic Nash-Cournot model for the European gas market,” Working Paper G-87-24, École des Hautes Études Commeriales, Université de Montréal (Montréal, Que., 1987).
[111]D.W. Hearn, ”The gap function of a convex program,”Operations Research Letters 1 (1982) 67–71. · Zbl 0486.90070 · doi:10.1016/0167-6377(82)90049-9
[112]D.W. Hearn, S. Lawphongpanich and S. Nguyen, ”Convex programming formulation of the asymmetric traffic assignment problem,”Transportation Research 18B (1984) 357–365.
[113]D.W. Hearn, S. Lawphongpanich and J.A. Ventura, ”Restricted simplicial decomposition: computation and extensions,”Mathematical Programming Study 31 (1987) 99–118.
[114]W. Hildenbrand and A.P. Kirman,Introduction to Equilibrium Analysis (North-Holland, Amsterdam, 1976).
[115]A.V. Holden, ed.,Chaos (Princeton University Press, Princeton, NJ, 1986).
[116]T. Ichiishi,Game Theory for Economic Analysis (Academic Press, New York, 1983).
[117]C.M. Ip,The Distorted Stationary Point Problem. Ph.D. dissertation, School of Operations Research and Industrial Engineering, Cornell University (Ithaca, NY, 1986).
[118]K. Jittorntrum, ”Solution point differentiability without strict complementarity in nonlinear programming,”Mathematical Programming Study 21 (1984) 127–138.
[119]P.C. Jones, G. Morrison, J.C. Swarts and E. Theise, ”Nonlinear spatial price equilibrium algorithms: a computational comparison,”Microcomputers in Civil Engineering 3 (1988) 265–271.
[120]P.C. Jones, R. Saigal and M. Schneider, ”Computing nonlinear network equilibria,”Mathematical Programming 31 (1985) 57–66. · Zbl 0571.90091 · doi:10.1007/BF02591861
[121]N.H. Josephy, ”Newton’s method for generalized equations,” Technical Report No. 1965, Mathematics Research Center, University of Wisconsin (Madison, WI, 1979).
[122]N.H. Josephy, ”Quasi-Newton methods for generalized equations,” Technical Report No. 1966, Mathematics Research Center, University of Wisconsin (Madison, WI, 1979).
[123]N.H. Josephy, ”A Newton method for the PIES energy model,” Technical Summary Report No. 1977, Mathematics Research Center, University of Wisconsin (Madison, WI, 1979).
[124]S. Karamardian, ”The nonlinear complementarity problem with applications, parts I and II,”Journal of Optimization Theory and Applications 4 (1969) 87–98 and 167-81. · Zbl 0169.06901 · doi:10.1007/BF00927414
[125]S. Karamardian, ”Generalized complementarity problem,”Journal of Optimization Theory and Applications 8 (1971) 161–167. · Zbl 0208.46301 · doi:10.1007/BF00932464
[126]S. Karamardian, ”The complementarity problem,”Mathematical Programming 2 (1972) 107–129. · Zbl 0247.90058 · doi:10.1007/BF01584538
[127]S. Karamardian, ”Complementarity problems over cones with monotone and pseudomonotone maps,”Journal of Optimization Theory and Applications 18 (1976) 445–454. · Zbl 0304.49026 · doi:10.1007/BF00932654
[128]S. Karamardian, ”An existence theorem for the complementarity problem,”Journal of Optimization Theory and Applications 18 (1976) 445–454. · Zbl 0304.49026 · doi:10.1007/BF00932654
[129]W. Karush,Minima of Functions of Several Variables with Inequalities as Side Conditions. M.S. thesis, Department of Mathematics, University of Chicago (Chicago, IL, 1939).
[130]D. Kinderlehrer and G. Stampacchia,An Introduction to Variational Inequalities and Their Application (Academic Press, New York, 1980).
[131]M. Kojima, ”Computational methods for solving the nonlinear complementarity problem,”Keio Engineering Reports 27 (1974) 1–41.
[132]M. Kojima, ”A unification of the existence theorems of the nonlinear complementarity problem,”Mathematical Programming 9 (1975) 257–277. · Zbl 0347.90039 · doi:10.1007/BF01681350
[133]M. Kojima, ”Strongly stable stationary solutions in nonlinear programming,” in: S.M. Robinson, ed.,Analysis and Computation of Fixed Points (Academic Press, New York, 1980) pp. 93–138.
[134]M. Kojima, S. Mizuno, and T. Noma, ”A new continuation method for complementarity problems with uniform P-functions,”Mathematical Programming 43 (1989) 107–114. · Zbl 0673.90084 · doi:10.1007/BF01582283
[135]M. Kojima, S. Mizuno, and T. Noma, ”Limiting behavior of trajectories generated by a continuation method for monotone complementarity problems,” Research Report No. B-199, Department of Information Sciences, Tokyo Institute of Technology (Tokyo, Japan, 1988).
[136]M.M. Kostreva, ”Block pivot methods for solving the complementarity problem,”Linear Algebra and Its Application 21 (1978) 207–215. · Zbl 0395.65032 · doi:10.1016/0024-3795(78)90083-6
[137]M.M. Kostreva, ”Elasto-hydrodynamic lubrication: a nonlinear complementarity problem,”International Journal for Numerical Methods in Fluids 4 (1984) 377–397. · Zbl 0551.76007 · doi:10.1002/fld.1650040407
[138]H. Kremers and D. Talman, ”Solving the nonlinear complementarity problem with lower and upper bounds,” FEW330, Department of Econometrics, Tilburg University (Tilburg, The Netherlands, 1988).
[139]H.W. Kuhn, ”Simplicial approximation of fixed points,”Proceedings of the National Academy of Sciences U.S.A. 61 (1968) 1238–1242. · Zbl 0191.54904 · doi:10.1073/pnas.61.4.1238
[140]H.W. Kuhn and A.W. Tucker, ”Nonlinear programming,” in: J. Neyman, ed.,Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability, (University of California Press, Berkeley, CA, 1951) pp. 481–492.
[141]J. Kyparisis, ”Uniqueness and differentiability of solutions of parametric nonlinear complementarity problems,”Mathematical Programming 36 (1986) 105–113. · Zbl 0613.90096 · doi:10.1007/BF02591993
[142]J. Kyparisis, ”Sensitivity analysis framework for variational inequalities,”Mathematical Programming 38 (1987) 203–213. · doi:10.1007/BF02604641
[143]J. Kyparisis, ”Perturbed solutions of variational inequality problems over polyhedral sets,”Journal of Optimization Theory and Applications 57 (1988) 295–305. · Zbl 0621.49004 · doi:10.1007/BF00938541
[144]J. Kyparisis, ”Sensitivity analysis for nonlinear programs and variational inequalities with nonunique multipliers,” Working paper, Department of Decision Sciences and Information Systems, Florida International University (Miami, FL, 1987).
[145]S. Lawphongpanich and D.W. Hearn, ”Simplicial decomposition of asymmetric traffic assignment problem,”Transportation Research 18B (1984) 123–133.
[146]S. Lawphongpanich and D.W. Hearn, ”Bender’s decomposition for variational inequalities,”Mathematical Programming (Series B) 48 (1990) 231–247, this issue. · Zbl 0722.90024 · doi:10.1007/BF01582257
[147]S. Lawphongpanich and D.W. Hearn, ”Restricted simplicial decomposition with application to the traffic assignment problem,”Ricera Operativa 38 (1986) 97–120.
[148]L.J. LeBlanc, E.K. Morlok and W.P. Pierskalla, ”An efficient approach to solving the road network equilibrium traffic assignment problem,”Transportation Research 9 (1974) 309–318. · doi:10.1016/0041-1647(75)90030-1
[149]C.E. Lemke, ”Bimatrix equilibrium points and mathematical programming,”Management Science 11 (1965) 681–689. · Zbl 0139.13103 · doi:10.1287/mnsc.11.7.681
[150]C.E. Lemke and J.T. Howson, ”Equilibrium points of bimatrix games,”SIAM Review 12 (1964) 45–78.
[151]Y.Y. Lin and J.S. Pang, ”Iterative methods for large convex quadratic programs: a survey,”SIAM Journal on Control and Optimization 25 (1987) 383–411. · Zbl 0624.90083 · doi:10.1137/0325023
[152]J.L. Lions and G. Stampacchia, ”Variational inequalities,”Communications on Pure and Applied Mathematics 20 (1967) 493–519. · Zbl 0152.34601 · doi:10.1002/cpa.3160200302
[153]H.J. Lüthi, ”On the solution of variational inequality by the ellipsoid method,”Mathematics of Operations Research 10 (1985) 515–522. · Zbl 0586.49016 · doi:10.1287/moor.10.3.515
[154]T.L. Magnanti, ”Models and algorithms for predicting urban traffic equilibria,” in: M. Florian, ed.,Transportation Planning Models (North-Holland, Amsterdam, 1984) pp. 153–185.
[155]O. Mancino and G. Stampacchia, ”Convex programming and variational inequalities,”Journal of Optimization Theory and Application 9 (1972) 3–23. · Zbl 0223.90031 · doi:10.1007/BF00932801
[156]O.L. Mangasarian, ”Equivalence of the complementarity problem to a system of nonlinear equations,”SIAM Journal on Applied Mathematics 31 (1976) 89–92. · Zbl 0339.90051 · doi:10.1137/0131009
[157]O.L. Mangasarian, ”Locally unique solutions of quadratic programs, linear and nonlinear complementarity problems,”Mathematical Programming 19 (1980) 200–212. · Zbl 0442.90089 · doi:10.1007/BF01581641
[158]O.L. Mangasarian and L. McLinden, ”Simple bounds for solutions of monotone complementarily problems and convex programs,”Mathematical Programming 32 (1985) 32–40. · Zbl 0567.90093 · doi:10.1007/BF01585657
[159]A.S. Manne, ”On the formulation and solution of economic equilibrium models,”Mathematical Programming Study 23 (1985) 1–22.
[160]A.S. Manne and P.V. Preckel, ”A three-region intertemporal model of energy, international trade and capital flows,”Mathematical Programming Study 23 (1985) 56–74.
[161]P. Marcotte, ”Network optimization with continuous control parameters,”Transportation Science 17 (1983) 181–197. · doi:10.1287/trsc.17.2.181
[162]P. Marcotte, ”Quelques notes et résultats nouveaux sur les problème d’equilibre d’un oligopole,”R.A.I.R.O. Recherche Opérationnelle 18 (1984) 147–171.
[163]P. Marcotte, ”A new algorithm for solving variational inequalities with application to the traffic assignment problem,”Mathematical Programming 33 (1985) 339–351. · doi:10.1007/BF01584381
[164]P. Marcotte, ”Gap-decreasing algorithms for monotone variational inequalities,” paper presented at the ORSA/TIMS Meeting, Miami Beach, October 1986.
[165]P. Marcotte, ”Network design with congestion effects: a case of bi-level programming,”Mathematical Programming 34 (1986) 142–162. · Zbl 0604.90053 · doi:10.1007/BF01580580
[166]P. Marcotte and J.P. Dussault, ”A modified Newton method for solving variational inequalities,”Proceeding of the 24th IEEE Conference on Decision and Control, pp. 1433–1436.
[167]P. Marcotte and J.P. Dussault, ”A note on a globally convergent Newton method for solving monotone variational inequalities,”Operations Research Letters 6 (1987) 35–42. · Zbl 0623.65073 · doi:10.1016/0167-6377(87)90007-1
[168]L. Mathiesen, ”Computation of economic equilibria by a sequence of linear complementarity problems,”Mathematical Programming Study 23 (1985) 144–162.
[169]L. Mathiesen, ”Computational experience in solving equilibrium models by a sequence of linear complementarity problems,”Operations Research 33 (1985) 1225–1250. · Zbl 0583.90097 · doi:10.1287/opre.33.6.1225
[170]L. Mathiesen, ”An algorithm based on a sequence of linear complementarity problems applied to a Walrasian equilibrium model: an example,”Mathematical Programming 37 (1987) 1–18. · Zbl 0613.90098 · doi:10.1007/BF02591680
[171]L. Mathiesen and A. Lont, ”Modeling market equilibria: an application to the world steel market,” Working Paper MU04, Center for Applied Research, Norwegian School of Economics and Business Administration (Bergen, Norway, 1983).
[172]L. Mathiesen and E. Steigum, Jr., ”Computation of unemployment equilibria in a two-country multi-period model with neutral money,” Working Paper, Center for Applied Research, Norwegian School of Economics and Business Administration (Bergen, Norway, 1985).
[173]L. McKenzie, ”Why compute economic equilibria?,” in:Computing Equilibria: How and Why (North-Holland, Amsterdam, 1976).
[174]L. McLinden, ”The complementarity problem for maximal monotone multifunctions,” in: R.W. Cottle, F. Giannessi and J.L. Lions, eds.,Variational Inequalities and Complementarity Problems (Academic Press, New York, 1980) pp. 251–270.
[175]L. McLinden, ”An analogue of Moreau’s proximation theorem, with application to the nonlinear complementarity problem,”Pacific Journal of Mathematics 88 (1980) 101–161.
[176]L. McLinden, ”Stable monotone variational inequalities,”Mathematical Programming (Series B) 48 (1990) 303–338, this issue. · Zbl 0726.90093 · doi:10.1007/BF01582261
[177]N. Megiddo, ”A monotone complementarity problem with feasible solutions but no complementary solutions,”Mathematical Programming 12 (1977) 131–132. · Zbl 0353.90084 · doi:10.1007/BF01593775
[178]N. Megiddo, ”On the parametric nonlinear complementarity problem,”Mathematical Programming Study 7 (1978) 142–159.
[179]N. Megiddo and M. Kojima, ”On the existence and uniqueness of solutions in nonlinear complementarity theory,”Mathematical Programming 12 (1977) 110–130. · Zbl 0363.90102 · doi:10.1007/BF01593774
[180]G.J. Minty, ”Monotone (non-linear) operators in Hilbert space,”Duke Mathematics Journal 29 (1962) 341–346. · Zbl 0111.31202 · doi:10.1215/S0012-7094-62-02933-2
[181]J.J. Moré, ”The application of variational inequalities to complementarity problems and existence theorems,” Technical Report 71–90, Department of Computer Sciences, Cornell University (Ithaca, NY, 1971).
[182]J.J. Moré, ”Classes of functions and feasibility conditions in nonlinear complementarity problems,”Mathematical Programming 6 (1974) 327–338. · Zbl 0291.90059 · doi:10.1007/BF01580248
[183]J.J. Moré, ”Coercivity conditions in nonlinear complementarity problems,”SIAM Review 17 (1974) 1–16. · Zbl 0272.65041 · doi:10.1137/1016001
[184]J.J. Moré and W.C. Rheinboldt, ”On P- and S-functions and related classes of n-dimensional nonlinear mappings,”Linear Algebra and Its Applications 6 (1973) 45–68. · Zbl 0247.65038 · doi:10.1016/0024-3795(73)90006-2
[185]J.J. Moreau, ”Proximitè et dualitè dans un espace Hilberiten,”Bulletin of the Society of Mathematics of France 93 (1965) 273–299.
[186]J.D. Murchland, ”Braess’ paradox of traffic flow,”Transportation Research 4 (1970) 391–394. · doi:10.1016/0041-1647(70)90196-6
[187]K.G. Murty,Linear Complementarity, Linear and Nonlinear Programming (Helderman, Berlin, 1988).
[188]A. Nagurney, ”Comparative tests of multimodal traffic equilibrium methods,”Transportation Research 18B (1984) 469–485.
[189]A. Nagurney, ”Computational comparisons of algorithms for general asymmetric traffic equilibrium problems with fixed and elastic demand,”Transportation Research 20B (1986) 78–84.
[190]A. Nagurney, ”Computational comparisons of spatial price equilibrium methods,”Journal of Regional Science 27 (1987) 55–76. · doi:10.1111/j.1467-9787.1987.tb01144.x
[191]A. Nagurney, ”Competitive equilibrium problems, variational inequalities and regional science,”Journal of Regional Science 27 (1987) 503–517. · doi:10.1111/j.1467-9787.1987.tb01179.x
[192]J.F. Nash, ”Equilibrium points in n-person games,”Proceedings of the National Academy of Sciences 36 (1950) 48–49. · Zbl 0036.01104 · doi:10.1073/pnas.36.1.48
[193]S. Nguyen and C. Dupuis, ”An efficient method for computing traffic equilibria in networks with asymmetric transportation costs,”Transportation Science 18 (1984) 185–202. · doi:10.1287/trsc.18.2.185
[194]J.M. Ortega and W.C. Rheinboldt,Iterative Solution of Nonlinear Equations in Several Variables (Academic Press, New York, 1970).
[195]A.R. Pagan and J.H. Shannon, ”Sensitivity analysis for linearized computable general equilibrium models,” in: J. Piggott and J. Whalley, eds.,New Developments in Applied General Equilibrium Analysis (Cambridge University Press, Cambridge, 1985) pp. 104–118.
[196]J.S. Pang,Least-Element Complementarity Theory. Ph.D. dissertation, Department of Operations Research, Stanford University (Stanford, CA, 1976).
[197]J.S. Pang, ”The implicit complementarity problem”, in: O.L. Managasarian, R.R. Meyer and S.M. Robinson, eds.,Nonlinear Programming 4 (Academic Press, New York, 1981) 487–518.
[198]J.S. Pang, ”A column generation technique for the computation of stationary points,”Mathematics of Operations Research 6 (1981) 213–244. · Zbl 0497.90071 · doi:10.1287/moor.6.2.213
[199]J.S. Pang, ”On the convergence of a basic iterative method for the implicit complementarity problem,”Journal of Optimization Theory and Application 37 (1982) 149–162. · Zbl 0482.90084 · doi:10.1007/BF00934765
[200]J.S. Pang, ”Solution of the general multicommodity spatial equilibrium problem by variational and complementarity methods,”Journal of Regional Science 24 (1984) 403–414. · doi:10.1111/j.1467-9787.1984.tb00811.x
[201]J.S. Pang, ”Variational inequality problems over product sets: applications and iterative methods,”Mathematical Programming 31 (1985) 206–219. · Zbl 0578.49006 · doi:10.1007/BF02591749
[202]J.S. Pang, ”Inexact Newton methods for the nonlinear complementarity problem,”Mathematical Programming 36 (1986) 54–71. · Zbl 0613.90097 · doi:10.1007/BF02591989
[203]J.S. Pang, ”A posteriori error bounds for linearly constrained variational inequality problems,”Mathematics of Operations Research 12 (1987) 474–484. · doi:10.1287/moor.12.3.474
[204]J.S. Pang, ”Two characterization theorems in complementarity theory,”Operations Research Letters 7 (1988) 27–31. · Zbl 0643.90087 · doi:10.1016/0167-6377(88)90048-X
[205]J.S. Pang, ”Newton’s method for B-differentiable equations,” to appear in:Mathematics of Operations Research.
[206]J.S. Pang, ”Solution differentiability and continuation of Newton’s method for variational inequality problems over polyhedral sets,” to appear in:Journal of Optimization Theory and Applications.
[207]J.S. Pang and D. Chan, ”Iterative methods for variational and complementarity problems,”Mathematical Programming 24 (1982) 284–313. · Zbl 0499.90074 · doi:10.1007/BF01585112
[208]J.S. Pang and J.M. Yang, ”Parallel Newton methods for the nonlinear complementarity problem,”Mathematical Programming (Series B) 42 (1988) 407–420. · Zbl 0665.90091 · doi:10.1007/BF01589414
[209]J.S. Pang and C.S. Yu, ”Linearized simplicial decomposition methods for computing traffic equilibria on networks,”Networks 14 (1984) 427–438. · Zbl 0545.90037 · doi:10.1002/net.3230140306
[210]P.V. Preckel, ”Alternative algorithms for computing economic equilibria,”Mathematical Programming Study 23 (1985) 163–172.
[211]P.V. Preckel, ”A modified Newton method for the nonlinear complementarity problem and its implementation,” paper presented at the ORSA/TIMS Meeting, Miami Beach, FL, October 1986.
[212]Y. Qiu and T.L. Magnanti, ”Sensitivity analysis for variational inequalities defined on polyhedral sets,”Mathematics of Operations Research 14 (1989) 410–432. · Zbl 0698.90069 · doi:10.1287/moor.14.3.410
[213]Y. Qiu and T.L. Magnanti, ”Sensitivity analysis for variational inequalities,” Working Paper OR 163-87, Operations Research Center, M.I.T. (Cambridge, MA, 1987).
[214]A. Reinoza,A Degree For Generalized Equations. Ph.D. dissertation, Department of Industrial Engineering, University of Wisconsin (Madison, WI, 1979).
[215]A. Reinoza, ”The strong positivity conditions,”Mathematics of Operations Research 10 (1985) 54–62. · Zbl 0568.90080 · doi:10.1287/moor.10.1.54
[216]W.C. Rheinboldt,Numerical Analysis of Parameterized Nonlinear Equations (Wiley, New York, 1986).
[217]S.M. Robinson, ”Generalized equations and their solutions, part I: basic theory,”Mathematical Programming Study 10 (1979) 128–141.
[218]S.M. Robinson, ”Strongly regular generalized equations,”Mathematics of Operations Research 5 (1980) 43–62. · Zbl 0437.90094 · doi:10.1287/moor.5.1.43
[219]S.M. Robinson, ”Generalized equations and their solutions, part II: applications to nonlinear programming,”Mathematical Programming Study 19 (1982) 200–221.
[220]S.M. Robinson, ”Generalized equations,” in: A. Bachem, M. Grötschel and B. Korte, eds.,Mathematical Programming: The State of the Art (Springer, Berlin, 1982) pp. 346–367.
[221]S.M. Robinson, ”Implicit B-differentiability in generalized equations,” Technical Summary Report No. 2854, Mathematics Research Center, University of Wisconsin (Madison, WI, 1985).
[222]S.M. Robinson, ”Local structure of feasible sets in nonlinear programming, part III: stability and sensitivity,”Mathematical Programming Study 30 (1987) 45–66.
[223]S.M. Robinson, ”An implicit-function theorem for a class of nonsmooth functions,” to appear in:Mathematics of Operations Research.
[224]R.T. Rockafellar, ”Characterization of the subdifferentials of convex functions,”Pacific Journal of Mathematics 17 (1966) 497–510.
[225]R.T. Rockafellar, ”Convex functions, monotone operators, and variational inequalities,”Theory and Applications of Monotone Operators: Proceedings of the NATO Advanced Study Institute, Venice, Italy (Edizioni Oderisi, Gubbio, Italy, 1968) pp. 35–65.
[226]R.T. Rockafellar, ”On the maximal monotonicity of subdifferential mappings,”Pacific Journal of Mathematics 33 (1970) 209–216.
[227]R.T. Rockafellar,Convex Analysis (Princeton University Press, Princeton, NJ, 1970).
[228]R.T. Rockafellar, ”Augmented Lagrangian and application of the proximal point algorithm in convex programming,”Mathematics of Operations Research 1 (1976) 97–116. · Zbl 0402.90076 · doi:10.1287/moor.1.2.97
[229]R.T. Rockafellar, ”Monotone operators and the proximal point algorithm,”SIAM Journal on Control and Optimization 14 (1976) 877–898. · Zbl 0358.90053 · doi:10.1137/0314056
[230]R.T. Rockafellar, ”Lagrange multipliers and variational inequalities,” in: R.W. Cottle, F. Giannessi, and J.L.Lions, eds.,Variational Inequalities and Complementarity Problems: Theory and Applications (Wiley, New York, 1980) pp. 303–322.
[231]T.F. Rutherford,Applied General Equilibrium Modeling. Ph.D. dissertation Department of Operations Research, Stanford University (Stanford, CA, 1986).
[232]T.F. Rutherford, ”Implementation issues and computational performance solving applied general equilibrium models with SLCP,” Discussion Paper 837, Cowles Foundation for Research in Economics, Yale University (New Haven, CT, 1987).
[233]R. Saigal, ”Extension of the generalized complementarity problem,”Mathematics of Operations Research 1 (1976) 260–266. · Zbl 0363.90091 · doi:10.1287/moor.1.3.260
[234]P.A. Samuelson, ”Spatial price equilibrium and linear programming,”American Economic Review 42 (1952) 283–303.
[235]H.E. Scarf, ”The approximation of fixed points of a continuous mapping,”SIAM Journal on Applied Mathematics 15 (1967) 1328–1342. · Zbl 0153.49401 · doi:10.1137/0115116
[236]H.E. Scarf and T. Hansen,Computation of Economic Equilibria (Yale University Press, New Haven, CT, 1973).
[237]A. Shapiro, ”On concepts of directional differentiability,” Research Report 73/88(18), Department of Mathematics and Applied Mathematics, University of South Africa (Pretoria, South Africa, 1988).
[238]J.B. Shoven, ”Applying fixed points algorithms to the analysis of tax policies,” in: S. Karmardian and C.B. Garcia, eds.,Fixed Points: Algorithms and Applications (Academic Press, New York, 1977) pp. 403–434.
[239]J.B. Shoven, ”The application of fixed point methods to economics,” in: B.C. Eaves, F.J. Gould, H.O. Peitgen, and M.J. Todd, eds.,Homotopy Methods and Global Convergence (Plenum Press, New York, 1983) pp. 249–262.
[240]S. Smale, ”A convergent process of price adjustment and global Newton methods,”Journal of Mathematical Economics 3 (1976) 107–120. · Zbl 0354.90018 · doi:10.1016/0304-4068(76)90019-7
[241]M.J. Smith, ”The existence, uniqueness and stability of traffic equilibria,”Transportation Research 13B (1979) 295–304.
[242]M.J. Smith, ”The existence and calculation of traffic equilibria,”Transportation Research 17B (1983) 291–303.
[243]M.J. Smith, ”A descent algorithm for solving monotone variational inequality and monotone complementarity problems,”Journal of Optimization Theory and Application 44 (1984) 485–496. · Zbl 0535.49023 · doi:10.1007/BF00935463
[244]M.J. Smith, ”The stability of a dynamic model of traffic assignment- an application of a method of Lyapunov,”Transportation Science 18 (1984) 245–252. · doi:10.1287/trsc.18.3.245
[245]T.E. Smith, ”A solution condition for complementarity problems: with an apilication to spatial price equilibrium,”Applied Mathematics and Computation 15 (1984) 61–69. · Zbl 0545.90094 · doi:10.1016/0096-3003(84)90053-5
[246]J.E. Spingarn, ”Partial inverse of a monotone operator,”Applied Mathematics and Optimization 10 (1983) 247–265. · Zbl 0524.90072 · doi:10.1007/BF01448388
[247]J.E. Spingarn, ”Applications of the method of partial inverses to convex programming: decomposition,”Mathematical Programming 32 (1985) 199–223. · Zbl 0565.90058 · doi:10.1007/BF01586091
[248]J.E. Spingarn, ”On computation of spatial economic equilibria,” Discussion Paper 8731, Center for Operations Research and Econometrics, Université Catholique de Louvain (Louvain-la-Neuve, Belgium, 1987).
[249]G. Stampacchia, ”Variational inequalities,” inTheory and Applications of Monotone Operators, Proceedings of the NATO Advanced Study Institute, Venice, Italy (Edizioni Oderisi, Gubbio, Italy, 1968) pp. 102–192.
[250]R. Steinberg and R.E. Stone, ”The prevalence of paradoxes in transportation equilibrium problems,” Working paper, AT&T Bell Laboratories (Holmdel, NJ, 1987).
[251]R. Steinberg and W.I. Zangwill, ”The prevalence of Braess’ paradox,”Transportation Science 17 (1983) 301–319. · doi:10.1287/trsc.17.3.301
[252]J.C. Stone, ”Sequential optimization and complementarity techniques for computing economic equilibria,”Mathematical Programming Study 23 (1985) 173–191.
[253]P.K. Subramanian, ”Gauss-Newton methods for the nonlinear complementarity problem,” Technical Summary Report No. 2845, Mathematics Research Center, University of Wisconsin (Madison, WI, 1985).
[254]P.K. Subramanian, ”Fixed-point methods for the complementarity problem,” Technical Summary Report No. 2857, Mathematics Research Center, University of Wisconsin (Madison, WI, 1985).
[255]P.K. Subramanian, ”A note on least two norm solutions of monotone complementarity problems,”Applied Mathematics Letters 1 (1988) 395–397. · Zbl 0706.65061 · doi:10.1016/0893-9659(88)90158-9
[256]A. Tamir, ”Minimality and complementarity properties associated with Z-functions and Mfunctions,”Mathematical Programming 7 (1974) 17–31. · Zbl 0291.90057 · doi:10.1007/BF01585501
[257]R.L. Tobin, ”General spatial price equilibria: sensitivity analysis for variational inequality and nonlinear complementarity formulations,” in: P.T. Harker, ed.,Spatial Price Equilibrium: Advances in Theory, Computation and Application, Lecture Notes in Economics and Mathematical Systems, Vol. 249 (Springer, Berlin, 1985) pp. 158–195.
[258]R.L. Tobin, ”Sensitivity analysis for variational inequalities,”Journal of Optimization Theory and Applications 48 (1986) 191–204.
[259]M.J. Todd,The Computation of Fixed Points and Applications (Springer, Berlin, 1976).
[260]M.J. Todd, ”A note on computing equilibria in economics with activity models of production”,Journal of Mathematical Economics 6 (1979) 135–144. · Zbl 0432.90014 · doi:10.1016/0304-4068(79)90002-8
[261]G. Van der Laan and A.J.J. Talman, ”Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds,”Mathematical Programming 38 (1987) 1–15. · Zbl 0633.90082 · doi:10.1007/BF02591848
[262]J.A. Ventura and D.W. Hearn, ”Restricted simplicial decomposition for convex constrained problems,” Research Report No. 86-15, Department of Industrial and Systems Engineering, University of Florida (Gainesville, FL, 1986).
[263]J.G. Wardrop, ”Some theoretical aspects of road traffic research,”Proceedings of the Institute of Civil Engineers, Part II (1952) 325–378.
[264]L.T. Watson, ”Solving the nonlinear complementarity problem by a homotopy method,”SIAM Journal on Control and Optimization 17 (1979) 36–46. · Zbl 0407.90083 · doi:10.1137/0317004
[265]J. Whalley, ”Fiscal harmonization in the EEC: some preliminary findings of fixed point calculations,” in: S. Karamardian and C.B. Garcia, eds.,Fixed Points: Algorithms and Applications (Academic Press, New York, 1977) pp. 435–472.
[266]Y. Yamamoto, ”A path following algorithm for stationary point problems,”Journal of the Operations Research Society of Japan 30 (1987) 181–198.
[267]Y. Yamamoto, ”Fixed point algorithms for stationary point problems,” in: M. Zri and K. Tanabe, eds.,Mathematical Programming: Recent Developments and Applications (KTK Scientific Publishers, Tokyo, 1989) pp. 283–308.