Nimrod Megiddo Yinyu Ye (Revised, December 1989) Keywords: linear...  Home/Search
Context Related
| stanford.edu/%7Emegiddo/pd...lcprev.pdf 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: stanford.edu/~megiddo/bio (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The linear complementarity problem (LCP) can be viewed as the problem of minimizing x y subject to y = Mx+ q and x# y 0.We are interested in finding a pointwithx y !fflforagiven ffl?0: The algorithm proceeds by iteratively reducing the potential function ln x j y j # where, for example, ae =2n. The direction of movement in the original space can be viewed as follows. First, apply a linear scaling transformation to make the coordinates of the current point all equal to1 . Take a... (Update)
Context of citations to this paper: More
...the problem [18] 2 The central path is defined in the usual way. See Section 2. A ROUNDING PROCEDURE FOR LCP 3 for LCP are defined in [19, 31]. It will be shown in a quite elementary way that in a given neighborhood of the central path the variables fall apart in three classes...
.... us a lot of ideas to develop interior point algorithms for linear complementarity problems (LCP) and NCPs ([6, 8, 7, 13, 24, 26, 21, 22, 23, 20, 18, 27, 33, 38, 42, 46, 48, 47] etc. The global convergence of these algorithms has been shown by using the existence of the...
Cited by: More
A Unified ApproachtoInterior Point Algorithms - For Linear Complementarity (Correct)
A Note on Total Functions, Existence Theorems, and.. - Megiddo, Papadimitriou (1989) (Correct)
A Strongly Polynomial Rounding Procedure Yielding a.. - Illes, Peng, Roos.. (Correct)
Similar documents (at the sentence level):
35.8%: An Interior Point Potential Reduction Algorithm for the.. - Masakazu Kojima (Correct)
Active bibliography (related documents): More All
0.2: Linear Programming (For the Encyclopedia of Microcomputers) - Megiddo (1991) (Correct)
0.1: A General Framework of Continuation Methods for.. - Kojima, Mizuno, Megiddo (1994) (Correct)
0.1: Block P-Matrices - Elsner, Szulc, Mickiewicz (Correct)
Similar documents based on text: More All
0.4: A Unified Approach to Interior Point Algorithms for.. - Kojima, Megiddo.. (1991) (Correct)
0.4: Homotopy Continuation Methods for Nonlinear Complementarity .. - Kojima, Megiddo, Noma (1989) (Correct)
0.3: Homotopy Continuation Methods - For Nonlinear Complementarity (Correct)
Related documents from co-citation: More All
10: Interior Path-Following Primal-Dual Algorithm. Part I: Linear Programming (context) - Monteiro, Adler - 1989
10: A Unified Approach to Interior Point Algorithms for Linear Complementarity Probl.. - Kojima, Megiddo et al. - 1991
8: A polynomial-time algorithm for a class of linear complementary problems (context) - Kojima, Mizuno et al. - 1989
BibTeX entry: (Update)
M. Kojima, N. Megiddo and Y. Ye. An interior point potential reduction algorithm for the linear complementarity problem. Math. Programming, to appear. http://citeseer.ist.psu.edu/675694.html More
@misc{ kojima-interior,
author = "M. Kojima and N. Megiddo and Y. Ye",
title = "An interior point potential reduction algorithm for the linear complementarity
problem",
text = "M. Kojima, N. Megiddo and Y. Ye. An interior point potential reduction
algorithm for the linear complementarity problem. Math. Programming, to
appear.",
url = "citeseer.ist.psu.edu/675694.html" }
Citations (may not include all citations):73 Polynomial time algorithm for a class of linear complementar.. (context) - Kojima, Mizuno et al. - 1989
15 Polynomial affine algorithms for linear programming (context) - Gonzaga - 1988
7 A new polynomial-( algorithm for linear programming (context) - Karmarkar - 1984
6 The Jacobian matrix and global univalence of mappings (context) - Gale, Nikaido - 1965
1 A Note on the ComplexityofP-( LCP and Computing anEquilibriu.. (context) - Megiddo - 1988
1 An O(n L) potential reduction algorithm for linear programmi.. (context) - Ye - 1989
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://theory.stanford.edu/~megiddo/bio.html): More
Efficient Computation of Equilibria for Extensive.. - Koller, Megiddo, von.. (1995) (Correct)
A Note on Total Functions, Existence Theorems, and.. - Megiddo, Papadimitriou (1989) (Correct)
Tight Bounds and 2-Approximation Algorithms for.. - Hochbaum, Megiddo.. (1992) (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