Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications

Mathematical Programming

Volumn 48, Issue 1-3, 1990, Pages 161-220

  Harker, Patrick T ^a   Pang, Jong Shi ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

complementarity; fixed points; Nash equilibrium; network equilibrium; spatial price equilibrium; traffic assignment; Variational inequality; Walrasian equilibrium

Indexed keywords

EID: 0344704362     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/BF01582255     Document Type: Article

References (267)

1. Equilibria on a congested transportation network
2. Continuous equilibrium network design models
3. A Gauss-Seidel iteration method for nonlinear variational inequality problems over rectangles
4. On convergence of the PIES algorithm for computing equilibria
5. Simplicial and continuation methods for approximating fixed points and solutions to systems of equations
6. Computing economic equilibria on affine networks with Lemke's algorithm
7. An efficient simplicial algorithm for computing a zero of a convex union of smooth functions
8. Points de Nash dans le cas de fonctionnelles quadratiques et jeux differentials linéaires a N personnes
9. Contrôle impulsionnel et inéquations quasivariationnelles stationnaires
10. Nouvelle formulation de problèmes de contrôle impulsionnel et applications
11. Nouvelles méthodes en contrôle impulsionnel
12. Projection methods for variational inequalities with application to the traffic assignment problem
13. Existence and approximation of solutions of nonlinear variational inequalities
14. Integrability and mathematical programming models: a survey and parametric approach
15. The generalized quasi-variational inequality problem
16. Spatial price equilibrium sensitivity analysis
17. Product positioning under price competition
18. Nonlinear programs with positively bounded Jacobians
19. Complementarity and variational problems
20. Complementary pivot theory of mathematical programming
21. Quadratic forms semi-definite over convex cones
22. Sufficient matrices and the linear complementarity problem
23. Polyhedral sets having a least element
24. Traffic equilibria and variational inequalities
25. The general multimodal network equilibrium problem with elastic demand
26. Relaxation algorithms for the general asymmetric traffic equilibrium problem
27. An iterative scheme for variational inequalities
28. Sensitivity analysis in variational inequalities
29. Sensitivity analysis for the general spatial economic equilibrium problem
30. Sensitivity analysis for the asymmetric network equilibrium problem
31. Implicit complementarity problems and quasi-variational inequalities
32. On the basic theorem of complementarity
33. The linear complementarity problem
34. Homotopies for computation of fixed points
35. A short course in solving equations with PL homotopies
36. Computing stationary points
37. Computing stationary points, again
38. Where solving for stationary points by LCPs is mixing Newton iterates
39. Traffic equilibria on multiclass user transportation networks analyzed via variational inequalities
40. Fixed point models for the equilibrium problems on transportation networks
41. A linearization method for generalized complementarity problems
42. Generalized variational inequalities
43. General network equilibrium analysis
44. An economic equilibrium model on a multicommodity network
45. Sensitivity analysis in nonlinear programming under second order assumptions
46. On matrices with nonpositive off-diagonal elements and positive principal minors
47. A simplicial algorithm for the nonlinear complementarity problem
48. The nonlinear complementarity problem: existence and determination of solutions
49. Alternative variational inequality formulations of the network equilibrium—travel choice problem
50. Solution algorithms for network equilibrium models with asymmetric user costs
51. Nonlinear cost network models in transportation analysis
52. A new look at static spatial price equilibrium models
53. The convergence of diagonalization algorithms for asymmetric network equilibrium problems
54. Network equilibrium, design and aggregation
55. A nonlinear complementary formulation and solution procedure for the general derived demand network equilibrium problem
56. Freight network equilibrium: a review of the state of the art
57. Alternative algorithms for the general network spatial price equilibrium problem
58. A relaxed projection method for variational inequalities
59. On the uniqueness and stability of Nash-equilibria in noncooperative games
60. Application of degree theory in stability of the complementarity problem
61. On a direct algorithm for nonlinear complementarity problems
62. Existence theory for generalized nonlinear complementarity problems
63. Generalized descent methods for asymmetric systems of equations
64. On the approximation of Nash equilibrium points in an N-person noncooperative game
65. A variational inequality approach for the determination of oligopolistic market equilibrium
66. A generalized spatial price equilibrium model
67. Existence of competitive equilibria via Smith's nonlinear complementarity result
68. Alternative models of spatial competition
69. A note on the existence of traffic equilibria
70. Multiple equilibria behaviors on networks
71. Accelerating the convergence of the diagonalization and projection algorithms for finite-dimensional variational inequalities
72. The core of a spatial price equilibrium game
73. Privatization of urban mass transportation: application of computable equilibrium models for network competition
74. Existence of optimal solutions to mathematical programs with equilibrium constraints
75. A damped-Newton method for the linear complementarity problem
76. On some nonlinear elliptic differential functional equations
77. On the relationship between Nash-Cournot and Wardrop equilibria
78. A game-theoretic approach to network equilibrium
79. The gap function of a convex program
80. Convex programming formulation of the asymmetric traffic assignment problem
81. Restricted simplicial decomposition: computation and extensions
82. Solution point differentiability without strict complementarity in nonlinear programming
83. Nonlinear spatial price equilibrium algorithms: a computational comparison
84. Computing nonlinear network equilibria
85. The nonlinear complementarity problem with applications, parts I and II
86. Generalized complementarity problem
87. The complementarity problem
88. Complementarity problems over cones with monotone and pseudomonotone maps
89. An existence theorem for the complementarity problem
90. Computational methods for solving the nonlinear complementarity problem
91. A unification of the existence theorems of the nonlinear complementarity problem
92. Strongly stable stationary solutions in nonlinear programming
93. A new continuation method for complementarity problems with uniform P-functions
94. Block pivot methods for solving the complementarity problem
95. Elasto-hydrodynamic lubrication: a nonlinear complementarity problem
96. Simplicial approximation of fixed points
97. Nonlinear programming
98. Uniqueness and differentiability of solutions of parametric nonlinear complementarity problems
99. Sensitivity analysis framework for variational inequalities
100. Perturbed solutions of variational inequality problems over polyhedral sets
101. Simplicial decomposition of asymmetric traffic assignment problem
102. Bender's decomposition for variational inequalities
103. Restricted simplicial decomposition with application to the traffic assignment problem
104. An efficient approach to solving the road network equilibrium traffic assignment problem
105. Bimatrix equilibrium points and mathematical programming
106. Equilibrium points of bimatrix games
107. Iterative methods for large convex quadratic programs: a survey
108. Variational inequalities
109. On the solution of variational inequality by the ellipsoid method
110. Models and algorithms for predicting urban traffic equilibria
111. Convex programming and variational inequalities
112. Equivalence of the complementarity problem to a system of nonlinear equations
113. Locally unique solutions of quadratic programs, linear and nonlinear complementarity problems
114. Simple bounds for solutions of monotone complementarily problems and convex programs
115. On the formulation and solution of economic equilibrium models
116. A three-region intertemporal model of energy, international trade and capital flows
117. Network optimization with continuous control parameters
118. Quelques notes et résultats nouveaux sur les problème d'equilibre d'un oligopole
119. A new algorithm for solving variational inequalities with application to the traffic assignment problem
120. Network design with congestion effects: a case of bi-level programming
121. A note on a globally convergent Newton method for solving monotone variational inequalities
122. Computation of economic equilibria by a sequence of linear complementarity problems
123. Computational experience in solving equilibrium models by a sequence of linear complementarity problems
124. An algorithm based on a sequence of linear complementarity problems applied to a Walrasian equilibrium model: an example
125. Why compute economic equilibria?
126. The complementarity problem for maximal monotone multifunctions
127. An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
128. Stable monotone variational inequalities
129. A monotone complementarity problem with feasible solutions but no complementary solutions
130. On the parametric nonlinear complementarity problem
131. On the existence and uniqueness of solutions in nonlinear complementarity theory
132. Monotone (non-linear) operators in Hilbert space
133. Classes of functions and feasibility conditions in nonlinear complementarity problems
134. Coercivity conditions in nonlinear complementarity problems
135. On P- and S-functions and related classes of n-dimensional nonlinear mappings
136. Proximitè et dualitè dans un espace Hilberiten
137. Braess' paradox of traffic flow
138. Comparative tests of multimodal traffic equilibrium methods
139. Computational comparisons of algorithms for general asymmetric traffic equilibrium problems with fixed and elastic demand
140. Computational comparisons of spatial price equilibrium methods
141. Competitive equilibrium problems, variational inequalities and regional science
142. Equilibrium points in n-person games
143. An efficient method for computing traffic equilibria in networks with asymmetric transportation costs
144. Sensitivity analysis for linearized computable general equilibrium models
145. The implicit complementarity problem
146. A column generation technique for the computation of stationary points
147. On the convergence of a basic iterative method for the implicit complementarity problem
148. Solution of the general multicommodity spatial equilibrium problem by variational and complementarity methods
149. Variational inequality problems over product sets: applications and iterative methods
150. Inexact Newton methods for the nonlinear complementarity problem
151. A posteriori error bounds for linearly constrained variational inequality problems
152. Two characterization theorems in complementarity theory
153. Iterative methods for variational and complementarity problems
154. Parallel Newton methods for the nonlinear complementarity problem
155. Linearized simplicial decomposition methods for computing traffic equilibria on networks
156. Alternative algorithms for computing economic equilibria
157. Sensitivity analysis for variational inequalities defined on polyhedral sets
158. The strong positivity conditions
159. Generalized equations and their solutions, part I: basic theory
160. Strongly regular generalized equations
161. Generalized equations and their solutions, part II: applications to nonlinear programming
162. Generalized equations
163. Local structure of feasible sets in nonlinear programming, part III: stability and sensitivity
164. Characterization of the subdifferentials of convex functions
165. On the maximal monotonicity of subdifferential mappings
166. Augmented Lagrangian and application of the proximal point algorithm in convex programming
167. Monotone operators and the proximal point algorithm
168. Lagrange multipliers and variational inequalities
169. Extension of the generalized complementarity problem
170. Spatial price equilibrium and linear programming
171. The approximation of fixed points of a continuous mapping
172. Applying fixed points algorithms to the analysis of tax policies
173. The application of fixed point methods to economics
174. A convergent process of price adjustment and global Newton methods
175. The existence, uniqueness and stability of traffic equilibria
176. The existence and calculation of traffic equilibria
177. A descent algorithm for solving monotone variational inequality and monotone complementarity problems
178. The stability of a dynamic model of traffic assignment- an application of a method of Lyapunov
179. A solution condition for complementarity problems: with an apilication to spatial price equilibrium
180. Partial inverse of a monotone operator
181. Applications of the method of partial inverses to convex programming: decomposition
182. Variational inequalities
183. The prevalence of Braess' paradox
184. Sequential optimization and complementarity techniques for computing economic equilibria
185. A note on least two norm solutions of monotone complementarity problems
186. Minimality and complementarity properties associated with Z-functions and Mfunctions
187. General spatial price equilibria: sensitivity analysis for variational inequality and nonlinear complementarity formulations
188. Sensitivity analysis for variational inequalities
189. A note on computing equilibria in economics with activity models of production
190. Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds
191. Solving the nonlinear complementarity problem by a homotopy method
192. Fiscal harmonization in the EEC: some preliminary findings of fixed point calculations
193. A path following algorithm for stationary point problems
194. Fixed point algorithms for stationary point problems