POLYNOMIALLY BOUNDED ELLIPSOID ALGORITHMS FOR CONVEX QUADRATIC PROGRAMMING11Research effort partially supported by the Air Force Office of Scientific Research, Air Force Systems Command, USAF, under grant No. AFOSR 78-3646. The United States Government is authorized to reproduce and distribute reprints for governmental purposes, notwithstanding any copyright notation hereon.-Reference-Cited by-同舟云学术

POLYNOMIALLY BOUNDED ELLIPSOID ALGORITHMS FOR CONVEX QUADRATIC PROGRAMMING11Research effort partially supported by the Air Force Office of Scientific Research, Air Force Systems Command, USAF, under grant No. AFOSR 78-3646. The United States Government is authorized to reproduce and distribute reprints for governmental purposes, notwithstanding any copyright notation hereon.

Published:1981 Issue: Volume: Page:439-485
ISSN:
Container-title:Nonlinear Programming 4
language:
Short-container-title:

Author:

Chung Sung J.,Murty Katta G.

Publisher

Elsevier

Reference27 articles.

1. I. Adler, R. P. McClean and J. S. Provan, “An Application of the Khachiyan-Shor algorithm to a class of linear complementarity problems”, Cowles Foundation discussion paper No. 549, Cowles Foundation for research in Economics, Yale University, Box 2125, Yale Station, New Haven, Connecticut 06520.

2. “A special class of the complementary pivot problem”;Chandrasekharan;OPSEARCH,1970

3. S. J. Chung, “The linear complementarity problem is NP-complete”, to appear in Mathematical Programming.

4. S. J. Chung and K. G. Murty, “A polynomially bounded algorithm for positive definite symmetric LCPs”, Technical Report 79–10, Department of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, Michigan 48109, December 1979.

5. “Complementary pivot theory of mathematical programming”;Cottle;Linear Algebra and its Applications,1968

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

1. Convex Quadratic Programming Relaxations for Network Scheduling Problems;Algorithms - ESA’ 99;1999

2. The linear complementarity problem as a separable bilinear program;Journal of Global Optimization;1995-03

3. Active constraints, indefinite quadratic test problems, and complexity;Journal of Optimization Theory and Applications;1991-03

4. A parallel algorithm for solving the linear complementarity problem;Annals of Operations Research;1988-12

5. An LP-based successive overrelaxation method for linear complementarity problems;Journal of Optimization Theory and Applications;1988-11