| Reference: | 參考文獻:
[1] M. Aganagic [1978], "Iterative Methods for Linear Complementarity Problems," Technical Report SOL 78-10 Systems Optimization Laboratory, Department of
Operations Research, Stanford University.
[2] B. H. Ahn [1981], "Computation of Asymmetric Linear Complementarity Problem by Iterative Method,"Journal of Optimization Theory and Applications 33,pp . 175-185.
[3] J. Barnes [1965], "An Algorithm for Solving Nonlinear Equations Based on the Secant Method," Computer Journal 8,pp. 66-72.
[4] G. M. Baudet [1978], "Asynchronous Iterative Methods for Multiprocessors", Journal of the Association for Computing Machinery 22, pp. 226-244.
[5] D. P. Bertsekas [1983], "Distributed Asynchronous Computation of Fixed Point", Mathematical Programming 27, pp. 107-120.
[6] R. P. Brent [1973],"Some Efficient Algorithms for Solving Systems of Nonlinear Equations," SIAM Journal On Numerical Analysis 10, PP. 327-344.
[7] Y. C. Cheng [1981], "Iterative Methods for Solving Linear Complementarity and Linear Programming Problems",Ph.D. dissertation, Department of Computer Science, University of Wisconsin (Madison Wisconsin).
[8] Y. C. Cheng [1984], "On the Gradient-Projection Method for Solving the Nonsymmetric Linear Complementarity Problem" , Journal of Optimization Theory and
Applications 43, pp. 527-541.
[9] R. W. Cottle, G. H. Golub and R. S. Sacher [1978],"On the Solution of Large Structured Linear Complementarity Problems: The Block Partitioned Case" ,Applied Mathematics and Optimization 4. pp. 347-363.
[10] C. W. Cryer [1971], "The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation,"SIAM Control 9, pp. 385-392.
[11] G. B. Dantzig [1963], Linear Programming and Extensions,Princeton University Press, Princeton, New Jersey.
[12] G. B. Dantzig, M. A. H. Dempster and M. J. Kallio (Eds.) [1981], Large-Scale Linear Programming. Vol. 1,Proceedings of a IIASA workshop 2-6 June 1980,International Institute for Applied Systems Analysis,Laxenburg,Austria.
[13] R. S. Dembo. S. C. Eisenstat and T. Steihaug [1982],"Inexact Newton Methods," SIAM Journal on Numerical Analysis 19, pp. 400-408.
[14] B. C. Eaves [1971], "On Quadratic Programming",Management Science 17, PP. 698-711.
[15] B. C. Eaves [1983], "Where Solving for Stationary Points by LCP`s IS Mixing Newton Iterates,"B. C. Eaves. F. J. Gould. H. O. Peitgen and M. J. Todd(eds.) Homotopy Methods and Global Convergence,(Plenum Press. New York) PP. 63-78.
[16] T. L. Friesz et. al. [1983], "A Nonlinear Complementarity Formulation and Solution Procedure for The General Derived Demand Network Equilibrium Problem" Journal of Regional Science, V.23, No.3, PP. 337-359.
[17] S. P. Han and o. L. Mangasarian [1983], "A Dual Differentiable Exact Penalty Function," Mathematical Programming 25, pp. 293-306.
[18] C. Hildreth [1957], A Quadratic Programming Procedure,Naval Research Logistics Quarterly 4, PP. 79-85,Erratum, ibid, p.361.
[19] R. W. Hockney [1985], "MIMD Computing in the USA -1984", Parallel Computing 2, pp. 119-136.
[20] N. H. Josephy [1979a], "Newton`s Method for Generalized Equations," Technical Summary Report No. 1965,Mathematics Research Center, University of Wisconsin
(Madison, Wisconsin).
[21] N. H. Josephy [1979b], "Quasi -Newton Methods for Generalized Equations," Technical Summary Report No. 1966, Mathematics Research Center, University of
Wisconsin (Madison, Wisconsin).
[22] N. Karmarkar [1984], "A New Polynomial-Time Algorithm for Linear Programming," Combinatorica 4, pp. 375-395.
[23] H. T. Kung [1976], "Synchronized and Asynchronous Parallel Algorithms for Multiprocessors", in J. F. Traub ed., Algorithms and Complexity: New Directions
and Recent Results (Academic Press) pp. 153-200.
[24] Y. Y. Lin and J. S. Pang [1987], "Iterative Methods for Large Convex Quadratic Programs: A Survey", SIAM Journal on Control and Optimization 25,pp. 383-411.
[25] O. L. Mangasarian [1977], "Solution of Symmetric Linear Complementarity Problems by Iterative Methods", Journal of Optimization Theory and Applications 22, pp.465-485.
[26] O. L. Mangasarian [1981], "Iterative Solution of Linear Programs," SIAM Journal on Numerical Analysis 18, pp. 606-614.
[27] O. L. Mangasarian [1984a], "Normal Solutions of Linear Programs," Mathematical Programming Study 22, pp. 206-216.
[28] O. L. Mangasarian [1984b], "Sparsity Preserving SOR Algorithms for Separable Quadratic and Linear Programming Problem," Computers and Operations Research, Vol. 11,pp. 105:-112.
[29] O. L. Mangasarian and R. De Leone [1986a], "Parallel Successive Overrelaxation Methods for Symmetric Linear Complementarity Problems and Linear Programs",Mathematics Research Center Report #2947, University of
Wisconsin (Madison, Wisconsin).
[30] O. L. Mangasarian and R. De Leone [1986b],"Paralle1 Gradient Projection Successive overrelaxation for Symmetric Linear Complementarity Problems and Linear Programs", Technical Report #659, Department of Computer Sciences, University of Wisconsin (Madison,Wisconsin).
[31] H. Mukai [1979], "Parallel Algorithms for Solving Systems of Nonlinear Equations", Proceedings of the 17th Annual Allerton Conference on Communications,Control and Computations pp. 37-46.
[32] D. P. O`Leary and R. E. White [1985], "Multi-splittings of Matrices and Parallel Solution of Linear Systems",SIAM Journal on Algebraic and Discrete Mathematics 6,pp. 630-640.
[33] J. M. Ortega and W. C. Rheinboldt [1970], Iterative Solution of Nonlinear Equations in Several Variables, Academic Press.
[34] J. M. Ortega and R. G. Voigt [1985], "Solution of Partial Differerntial Equations on Vector and Parallel Computers" , SIAM Review Vol 27, No.2, PP. 149-213.
[35] J. S. Pang [1982], "On the Convergence of a Basic Iterative Method for the Implicit Complementarity Problem", Journal of Optimization Theory and Applications 37. pp. 149-162.
[36] J. S. Pang [1984a], "Necessary and Sufficient Conditions for the Convergence of Iterative Methods for the Linear Complementarity Problem". Journal of Optimization
Theory and Applications 42. PP. 1-18.
[37] J. S. Pang [1984b], "Solution of the General Multicommodity Spatial Equilibrium Porblem by Variational and Complementarity Methods". Journal of Regional Science, V. 24, No.3,pp. 403-414.
[38] J. S. Pang [1986a], "More Results on the Convergence of Iterative Methods for the Symmetric Linear Complementarity Problem", Journal of Optimization Theory and Applications 49, pp. 107-134.
[39] J. S. Pang [1986b], "Inexact Newton Methods for the Nonlinear Complementarity Problem", Mathematical Programming 36,pp. 54-71.
[40] J. S. Pang [1987], "A Posteriori Error Bounds for the Linearly-Constrained Variational Inequality Problem, "Mathematices of Operations Research. to appear,
[41] J. S. Pang and D. Chan [1982], "Iterative Methods for Variational and Complementarity Problems," Mathematical Programming 24, pp. 284-313.
[42] J. S. Pang and J. M. Yang [1987a], "Two-stage Paralle1 Iterative Methods for the Symmetric Linear Complementarity Problem," to appear in Annals of Operations Research: Parallel Optimization on Novel Computer Architectures (1988).
[43] "J. S. Pang and J. M. Yang [1987b], "Paralle1 Newton Methods for the Nonlinear Complementarity Problem",Mathematical Programming Study: Proceedings of Symposium on Parallel Optimization. Madison,Wisconsin (1987).
[44] J. S. Pang and J. M. Yang [1987c], "Computationa1 Experience with Solving Linear Programs by Iterative Methods on CRAY Supercomputers", Proceedings of the Third Science and Engineering Symposium. Minneapolis,Minnesota (1987).
[45] E. Polak [1974], "A Globally Converging Secant Method with Applications to Boundary Value Problems," SIAM Journal on Numerical Analysis 11, pp. 529-537.
[46] R. T. Rockafellar [1976a], "Monotone Operators and the Proximal Point Algorithm," SIAM Journal on Control and Optimization 14, PP. 877-898.
[47] R. T. Rockafellar [1976b], "Augmented Lagrangians and Application of the Proximal Point Algorithm in Convex Programming," Mathematics of Operations Research 1,pp. 97-116.
[48] F. Robert [1969], "Blocs-H-Matrices et Convergence des Methodes Iterative Classiques par Blocs", Linear Algebra and its Applications 2, PP. 223-265.
[49] S. M. Robinson [1980],"Strongly Regular Generalized Equations," Mathematics of Operations Research 5,pp. 43-62.
[50] V. E. Shamanskii [1967], "On a Modification of Newton`s Method," Ukrain, Mat. Z. 19, PP. 133-138.
[51] T. H. Shiau [1984], "An Iterative Scheme for Linear Complementarity Problems," Technical Report #2737,Mathematices Research Center, University of Wisconsin-Madison.
[52]J. Traub [1964], Iterative Methods for the Solution of Equations, Prentice Hall, Englewood Cliffs, New Jersey.
[53] P. Wolfe [1959], "The Secant Method for Simultaneous Nonlinear Equations," Communications of the ACM 2,PP. 12-14.
[54J J. M. Yang [1987], "Parallel Iterative Methods for Complementarity and Linear Programming Problems" Ph.D. dissertation, School of Management Science,University of Texas at Dallas.
[55] S. A. Zenios and J. M. Mulvey [1986], "Nonlinear Network Programming on Vector Supercomputers: A Study on the CRAY X-MP", Operations Research 34, pp. 667-682.
[56] S. A. Zenios and R. R. Meyer (Eds.) [1987], Annals of Operations Research: Parallel Optimization on Novel Computer Architectures, forthcoming. |
