×

Iterative methods for variational and complementarity problems. (English) Zbl 0499.90074


MSC:

90C33 Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
65K05 Numerical mathematical programming methods
58E35 Variational inequalities (global problems) in infinite-dimensional spaces
91B50 General equilibrium theory
Full Text: DOI

References:

[1] H.Z. Aashtiani, ”The multi-modal traffic assignment problem”, Ph.D. dissertation, Alfred P. Sloan School of Management, Massachusetts Institute of Technology (May 1979).
[2] M. Aganagic, ”Variational inequalities and generalized complementarity problems”, Tech. Rept. SOL 78-11, Systems Optimization Laboratory, Department of Operations Research, Stanford University, Stanford CA (1978).
[3] B.-H. Ahn,Computation of market equilibria for policy analysis: The project independence evaluation systems (PIES) approach (Garland, New York, 1979).
[4] B.-H. Ahn, ”Computation of asymmetric linear complementarity problems by iterative methods”,Journal of Optimization Theory and Applications 33 (1981) 175–185. · Zbl 0422.90079 · doi:10.1007/BF00935545
[5] R.L. Asmuth, ”Traffic network equilibria”, Tech. Rept. SOL 78-2, Systems Optimization Laboratory, Department of Operations Research, Stanford University, Stanford, CA (1978).
[6] D. Chan and J.S. Pang, ”The generalized quasi-variational inequality problem”,Mathematics of Operations Research, to appear. · Zbl 0502.90080
[7] R.W. Cottle and M.S. Goheen, ”A special class of large quadratic programs”, in: O.L. Mangasarian, R.R. Meyer and S.M. Robinson, eds.,Nonlinear programming 3 (Academic Press, New York, 1978) pp. 361–390. · Zbl 0458.90049
[8] R.W. Cottle, G.H. Golub and R.S. Sacher, ”On the solution of large, structured linear complementarity problems: The block partitioned case”,Applied Mathematics and Optimization 4 (1978) 347–363. · Zbl 0391.90087
[9] R.W. Cottle and J.S. Pang, ”On solving linear complementarity problems as linear programs”,Mathematical Programming Study 7 (1978) 88–107. · Zbl 0381.90072
[10] R.W. Cottle and J.S. Pang, ”On the convergence of a block successive overrelaxation method for a class of linear complementarity problems”,Mathematical Programming Study 17 (1982) 126–138. · Zbl 0478.90069
[11] C.W. Cryer, ”The solution of quadratic programming problems using systematic overrelaxation”,SIAM Journal on Control 9 (1971) 385–392. · Zbl 0216.54603 · doi:10.1137/0309028
[12] S. Dafermos, ”Traffic equilibrium and variational inequalities”,Transportation Science 14 (1980) 42–54. · doi:10.1287/trsc.14.1.42
[13] S. Dafermos, ”An iterative scheme for variational inequalities”, Division of Applied Mathematics, Brown University (May 1981). · Zbl 0506.65026
[14] B.C. Eaves, ”Computing stationary points”,Mathematical Programming Study 7 (1978) 1–14. · Zbl 0379.90081
[15] 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. · Zbl 0458.65057
[16] B.C. Eaves, ”A locally quadratically convergent algorithm for computing stationary points”, Tech. Rept., Department of Operations Research, Stanford University, Stanford, CA (May 1978).
[17] B.C. Eaves and R. Saigal, ”Homotopies for the computation of fixed points on unbounded regions”,Mathematical Programming 3 (1972) 225–237. · Zbl 0258.65060 · doi:10.1007/BF01584991
[18] S.C. Fang, ”Traffic equilibria on multiclass-user transportation networks analysed via variational inequalities”, Mathematics Research Report 79-13, Department of Mathematics, University of Maryland, Baltimore County (November 1979).
[19] S.C. Fang, ”An iterative method for generalized complementarity problems”, Mathematics Research Report 79-11, Department of Mathematics, University of Maryland, Baltimore County (October 1979).
[20] S.C. Fang and E.L. Peterson, ”Generalized variational inequalities”, Mathematics Research Report 79-10, Department of Mathematics, University of Maryland, Baltimore County (October 1979). · Zbl 0471.49007
[21] S.C. Fang and E.L. Peterson, ”Economic equilibria on networks”, Mathematics Research Report 80-13, Department of Mathematics, University of Maryland, Baltimore County (May 1980).
[22] M. Fiedler and V. Ptak, ”On matrices with nonpositive off-diagonal elements and positive principal minors”,Czechoslovak Journal of Mathematics 12 (1962) 382–400. · Zbl 0131.24806
[23] M. Florian and H. Spiess, ”The convergence of diagonalization algorithms for asymmetric network equilibrium problems”,Transportation Research, to appear.
[24] W.W. Hogan, ”Project independence evaluation system: Structure and algorithms”,Proceedings of Symposia in Applied Mathematics of the American Mathematical Society 21 (1977) 121–137. · Zbl 0355.90074
[25] C.L. Irwin, ”Convergence properties of a PIES-type algorithm for non-integrable functions”, Tech. Rept. SOL 77-33, Systems Optimization Laboratory, Department of Operations Research, Stanford University, Stanford, CA (December 1977).
[26] C.L. Irwin, ”Analysis of a PIES-algorithm”, Symposium papers: Energy modelling and net energy analysis, Institute of Gas Technology (1978) 471–483.
[27] C.L. Irwin and C.W. Yang, ”Iteration and sensitivity for a nonlinear spatial equilibrium problem”, manuscript of a paper (August 1980).
[28] N.H. Josephy, ”Newton’s method for generalized equations”, Tech. Rept. 1965, Mathematics Research Center, University of Wisconsin, Madison, WI (June 1979).
[29] N.H. Josephy, ”Quasi-Newton methods for generalized equations”, Tech. Rept. 1966, Mathematics Research Center, University of Wisconsin, Madison, WI (June 1979).
[30] S. Karamardian, ”Generalized complementarity problem”,Journal of Optimization Theory and Applications 8 (1971) 161–168. · doi:10.1007/BF00932464
[31] O.L. Mangasarian, ”Linear complementarity problems solvable by a linear program”,Mathematical Programming 10 (1976) 263–270. · Zbl 0355.90040 · doi:10.1007/BF01580671
[32] O.L. Mangasarian, ”Solution of symmetric linear complementarity problems by iterative methods”,Journal of Optimization Theory and Applications 22 (1977) 465–485. · Zbl 0341.65049 · doi:10.1007/BF01268170
[33] J.M. Ortega,Numerical analysis; A second course (Academic Press, New York, 1972). · Zbl 0248.65001
[34] J.M. Ortega and W.C. Rheinboldt,Iterative solution of nonlinear-equations in several variables (Academic Press, New York, 1970). · Zbl 0241.65046
[35] J.S. Pang, ”HiddenZ-matrices with positive principal minors”,Linear Algebra and its Applications 23 (1979) 201–215. · Zbl 0413.15011 · doi:10.1016/0024-3795(79)90103-4
[36] J.S. Pang, ”A hybrid method for the solution of some multi-commodity spatial equilibrium problems”,Management Science 27 (1981) 1142–1157. · Zbl 0465.90065 · doi:10.1287/mnsc.27.10.1142
[37] J.S. Pang, ”A column generation technique for the computation of stationary points”,Mathematics of Operations Research 6 (1981) 213–224. · Zbl 0497.90071 · doi:10.1287/moor.6.2.213
[38] J.S. Pang, ”The implicit complementarity problem”, in: O.L. Mangasarian, R.R. Meyer and S.M. Robinson, eds.,Nonlinear programming 4 (Academic Press, New York, 1981) pp. 487–518. · Zbl 0534.90090
[39] J.S. Pang, ”On the convergence of a basic iterative method for the implicit complementarity problem”,Journal of Optimization Theory and Applications, to appear. · Zbl 0482.90084
[40] J.S. Pang, ”Approaches for convergence of a basic iterative method for the linear complementarity problem”, M.S.R.R. 446, GSIA, Carnegie-Mellon University, Pittsburgh, PA (November 1980).
[41] E.L. Peterson, ”The conical duality and complementarity of price and quantity for multicommodity spatial and temporal network allocation problems”, Discussion paper 207, Center for Mathematical Studies in Economics and Management Science, Northwestern University (March 1976).
[42] R.J. Plemmons, ”M-matrix characterizationI: NonsingularM-matrices”,Linear Algebra and its Applications 18 (1977) 175–188. · Zbl 0359.15005 · doi:10.1016/0024-3795(77)90073-8
[43] W. Rheinboldt, ”OnM-functions and their application to nonlinear Gauss–Seidel iterations and to network flows”,Journal of Mathematical Analysis and Applications 32 (1970) 274–307. · Zbl 0206.46504 · doi:10.1016/0022-247X(70)90298-2
[44] 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
[45] R.T. Rockafellar,Convex analysis (Princeton University Press, Princeton, NJ, 1970). · Zbl 0193.18401
[46] 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
[47] H. Samelson, R.M. Thrall and O. Wesler, ”A partition theorem for Euclideann-space”,Proceedings American Mathematical Society 9 (1958) 805–807. · Zbl 0117.37901
[48] G. Stampacchia, ”Variational inequalities”, in: A. Ghizzetti, ed.,Theory and applications of monotone operator, Proceedings of the NATO Advanced Study Institute, Venice, Italy (1968) 101–192.
[49] T. Takayama and G.G. Judge,Spatial and temporal price and allocation models (North-Holland, Amsterdam, 1971).
[50] A. Tamir, ”Minimality and complementarity properties associated withZ-functions andM-functions”,Mathematical Programming 7 (1974) 17–31. · Zbl 0291.90057 · doi:10.1007/BF01585501
[51] R. Thrasher, ”Notes on convergence of PIES-like iterative processes”, mimeographed, New Mexico State University (February 1978).
[52] D. Young,Iterative solution of large linear systems (Academic Press, New York, 1971). · Zbl 0231.65034
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.