A parallel algorithm for solving the linear complementarity problem-Reference-Cited by-同舟云学术

A parallel algorithm for solving the linear complementarity problem

Published:1988-12 Issue:1 Volume:14 Page:77-104
ISSN:0254-5330
Container-title:Annals of Operations Research
language:en
Short-container-title:Ann Oper Res

Author:

Phillips A. T.,Rosen J. B.

Publisher

Springer Science and Business Media LLC

Subject

Management Science and Operations Research,General Decision Sciences

Link

http://link.springer.com/content/pdf/10.1007/BF02186475.pdf

Reference14 articles.

1. Y.M. Bershchanskii andM.V. Meerov, The complementarity problem: Theory and methods of solution,Automat. Remote Control 44(6) (1983) 687–710.

2. S.J. Chung andK.G. Murty, Polynomially bounded ellipsoid algorithm for convex quadratic programming, in:Nonlinear Programming 4: Proc. Nonlinear Symposium 4, 1980, ed.O.L. Mangasarian, R.R. Meyer andS.M. Robinson (Academic Press, New York, 1981), p. 439–485.

3. R.W. Cottle andG.B. Dantzig, Complementary pivot theory of mathematical programming,Linear Algebra Appl. 1 (1968) 103–125.

4. R.W. Cottle, Some recent developments in linear complementarity theory, in:Variational Inequalities and Complementarity problems: Theory and Applications, ed.R.W. Cottle, F. Gianessi andJ.L. Lions, (Wiley, New York, 1980) 97–104.

5. CRAY RESEARCH INC. A Multitasking User Guide,CRAY Computer Systems Techn. Note (1985) SN-0222.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Parallel Computing in Global Optimization;Statistics: A Series of Textbooks and Monographs;2005-12-21

2. Parallel computing in nonconvex programming;Annals of Operations Research;1993-02

3. Guaranteed ε-approximate solution for indefinite quadratic global minimization;Naval Research Logistics;1990-08

4. The Impact of Parallel and Neural Computing on Managerial Decision Making;Journal of Management Information Systems;1989-12