On solving linear complementarity problems as linear programs-Reference-Cited by-同舟云学术

On solving linear complementarity problems as linear programs

Published:1978 Issue: Volume: Page:88-107
ISSN:0303-3929
Container-title:Mathematical Programming Studies
language:
Short-container-title:

Author:

Cottle Richard W.,Pang Jong-Shi

Publisher

Springer Berlin Heidelberg

Link

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

Reference27 articles.

1. S. Agmon, “The relaxation method for linear inequalities”, Canadian Journal on mathematics 6 (1954) 382–392.

2. C.M. Bregman, “The method of successive projection for finding a common point of convex sets”, Soviet Mathematics Doklady 6 (1965) 688–692.

3. R. Chandrasekaran, “A special case of the complementarity pivot problem”, Opsearch 7 (1970) 263–268.

4. R.W. Cottle, “The principal pivoting method of quadratic programming”, in: G.B. Dantzig A.F. Veinott, Jr., eds., Mathematics of the desision sciences, Part I (Am. Math. Soc., Providence, RI, 1968) pp. 148–162.

5. R.W. Cottle, “Manifestations of the Schur complement”, Linear Algebra and its Applications 8 (1974) 189–211.

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

1. On the number of pivots of Dantzig's simplex methods for linear and convex quadratic programs;Operations Research Letters;2024-03

2. Continuous Selections of Solutions to Parametric Variational Inequalities;SIAM Journal on Optimization;2024-02-28

3. Linear-step solvability of some folded concave and singly-parametric sparse optimization problems;Mathematical Programming;2022-01-20

4. A new concave minimization algorithm for the absolute value equation solution;Optimization Letters;2021-01-05

5. Methods for Linearly Constrained Problems;Nonlinear Optimization;2019