Masakazu Kojima, Nimrod Megiddo, Toshihito Noma, Akiko Yoshise  Home/Search
Context Related
| math.tau.ac.il/~megiddo/....kmnys.ps.gz stanford.edu/~megiddo/./p...kmnys.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: math.tau.ac.il/~megiddo/pub (more) From: stanford.edu/~megiddo/pub (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . This note summarizes a report with the same title, where a study was carried out regarding a unified approach, proposed by Kojima, Mizuno and Yoshise, for interior point algorithms for the linear complementarily problem with a positive semi-definite matrix. This approach is extended to nonsymmetric matrices with nonnegative principal minors. Keywords. interior-point methods, complementarity, linear programming, quadratic programming, path-following, potential reduction 1. Introduction. Many... (Update)
Cited by: More
A Unified ApproachtoInterior Point Algorithms - For Linear Complementarity (Correct)
Semidefinite Programming - Vandenberghe, Boyd (1995) (Correct)
A General Framework of Continuation Methods for.. - Masakazu Kojima Nimrod (1994) (Correct)
Active bibliography (related documents): More All
1.1: Theoretical Convergence of Large-Step Primal-Dual.. - Kojima, Megiddo, Mizuno (1992) (Correct)
0.5: Variational inequalities and the pricing of American options - Jaillet, Lamberton, Lapeyre (1989) (Correct)
0.2: Degeneracy in Interior Point Methods for Linear.. - Güler, den Hertog.. (1991) (Correct)
Similar documents based on text: More All
0.7: Homotopy Continuation Methods - For Nonlinear Complementarity (Correct)
0.6: Homotopy Continuation Methods for Nonlinear Complementarity .. - Kojima, Megiddo, Noma (1989) (Correct)
0.6: On A New Homotopy Continuation Trajectory For Nonlinear.. - Zhao, Li (2001) (Correct)
Related documents from co-citation: More All
43: Interior Path-Following Primal-Dual Algorithm. Part I: Linear Programming (context) - Monteiro, Adler - 1989
34: The Linear Complementarity Problem (context) - Cottle, Pang et al. - 1992
26: Pathways to the optimal set in linear programming (context) - Megiddo - 1986
BibTeX entry: (Update)
Kojima, M., Megiddo, N., Noma, T. and Yoshise, A., A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems, Springer-Verlag, Berlin, 1991. http://citeseer.ist.psu.edu/kojima91unified.html More
@article{ kojima91unified,
author = "M. Kojima and N. Megiddo and T. Noma and A. Yoshise",
title = "A unified approach to interior point algorithms for linear complementarity problems\,: {A} summary",
journal = "Operations Research Letters",
volume = "10",
pages = "247--254",
year = "1991",
url = "citeseer.ist.psu.edu/kojima91unified.html" }
Citations (may not include all citations):448 A new polynomial-time algorithm for linear programming (context) - Karmarkar - 1984 ACM DBLP
140 Interior path following primal-dual algorithms (context) - Monteiro, Adler - 1989 ACM
140 Interior path following primal-dual algorithms (context) - Monteiro, Adler - 1989 ACM
116 A Unified approach to interior point algorithms for linear c.. - Kojima, Megiddo et al. - 1990
101 Pathways to the optimal set in linear programming (context) - Megiddo - 1989 ACM
85 A primal-dual interior point algorithm for linear programmin.. (context) - Kojima, Mizuno et al. - 1989 ACM
79 Iterative solution of problems of linear and quadratic progr.. (context) - Dikin - 1967
73 A polynomial-time algorithm for a class of linear complement.. (context) - Kojima, Mizuno et al. - 1989 ACM
46 A variation on Karmarkar's algorithm for solving linear prog.. (context) - Barnes - 1986 ACM
43 iteration potential reduction algorithm for linear complemen.. (context) - Kojima, Mizuno et al.
43 A polynomial-time algorithm based on Newton's method for lin.. (context) - Renegar - 1988
40 A modification of Karmarkar's linear programming algorithm (context) - Vanderbei, Meketon et al. - 1986 DBLP
40 Homotopy continuation methods for nonlinear complementarity .. - Kojima, Megiddo et al. ACM
27 Sufficient matrices and the linear complementarity problem (context) - Cottle, Pang et al. - 1989
26 potential reduction algorithm for linear programming (context) - Ye - 1989
21 A centered projective algorithm for linear programming (context) - Todd, Ye - 1987 ACM
19 Centered Newton method for mathematical programming (context) - Tanabe - 1988
17 Polynomial-time algorithms for linear programming based only.. (context) - Freund - 1988 ACM
13 An interior point potential reduction algorithm for the line.. - Kojima, Megiddo et al. ACM
12 Recent developments and new directions in linear programming (context) - Todd - 1988
5 Complementarity-enforcing centered Newton method for mathema.. (context) - Tanabe - 1987
4 A polynomial-time predictor-corrector algorithm for linear c.. (context) - Ding, Li - 1989
3 Line search in potential reduction algorithms for linear pro.. - Ye - 1989
2 A note on the complexity of the LCP: the LCP is strongly NP-.. (context) - Chung - 1979
2 A polynomial time version of the affine algorithm (context) - Barnes, Chopra et al. - 1988
2 Center flattening transformation and a centered Newton metho.. (context) - Tanabe - 1987
2 A class of potential functions for linear programming (context) - Ye - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.math.tau.ac.il/~megiddo/pub.html): More
A General NP-Completeness Theorem - Megiddo (1993) (Correct)
On the Complexity of Some Geometric Problems in Unbounded Dimension - Megiddo (1990) (Correct)
A Sublinear Parallel Algorithm for Stable Matching - Tom'as Feder (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC