A new polynomial time method for a linear complementarity problem-Reference-Cited by-同舟云学术

A new polynomial time method for a linear complementarity problem

Published:1992-08 Issue:1-3 Volume:56 Page:31-43
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Mizuno Shinji

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

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

Reference16 articles.

1. R.W. Cottle and G.B. Dantzig, “Complementary pivot theory of mathematical programming,”Linear Algebra and its Applications 1 (1968) 103–125.

2. R.M. Freund, “Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function,”Mathematical Programming 51 (1991) 203–222.

3. C.C. Gonzaga, “An algorithm for solving linear programming programs in O(n 3 L) operations,” in: N. Megiddo, ed.,Progress in Mathematical Programming, Interior Point and Related Methods (Springer, New York, 1988) pp. 1–28.

4. N. Karmarkar, “A new polynomial-time algorithm for linear programming,”Combinatorica 4 (1984) 373–395.

5. M. Kojima, N. Megiddo and Y. Ye, “An interior point potential reduction algorithm for the linear complementarity problem,”Mathematical Programming 54 (1992) 267–279.

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

1. Optimal Diagonal Preconditioning;Operations Research;2024-03-04

2. Linear Programming;Numerical Methods and Optimization;2021

3. Convergence and polynomiality of primal-dual interior-point algorithms for linear programming with selective addition of inequalities;Optimization;2016-10-19

4. An interior–exterior approach for convex quadratic programming;Applied Numerical Mathematics;2012-09

5. Bibliography;Interior Point Algorithms;2011-10-14