Tomás Feder, Nimrod Megiddo, et al.
Theoretical Computer Science
As in many primal-dual interior-point algorithms, a primal-dual infeasible-interior-point algorithm chooses a new point along the Newton direction towards a point on the central trajectory, but it does not confine the iterates within the feasible region. This paper proposes a step length rule with which the algorithm takes large distinct step lengths in the primal and dual spaces and enjoys the global convergence. © 1993 The Mathematical Programming Society, Inc.
Tomás Feder, Nimrod Megiddo, et al.
Theoretical Computer Science
Nimrod Megiddo, Christos H. Papadimitriou
Theoretical Computer Science
Ching-Tien Ho, Rakesh Agrawal, et al.
SIGMOD Record (ACM Special Interest Group on Management of Data)
Daphne Koller, Nimrod Megiddo, et al.
Games and Economic Behavior