This paper establishes the superlinear convergence of a symmetric primal dual path following algorithm for semide nite programming under the assumptions that the semide nite pro gram has a strictly complementary primal dual optimal solution and that the size of the central path neighborhood tends to zero The interior point algorithm considered here closely resembles the Mizuno Todd Ye predictor...

Efficient navigation of mobile platforms in dynamic human-centered environments is still an open research topic. We have already proposed an architecture (MEPHISTO) for a navigation system that is able to fulfill the main requirements of efficient navigation: fast and reliable sensor processing, extensive global world modeling, and distributed path planning. Our architecture uses a distributed ...

This paper challenges the conventional thinking, by proposing a new way to understand and use the term critical-path. At stake is much more than a semantic discussion of terminology. Numerous surveys have confirmed that CPM schedules are used for two primary reasons: project management and dispute resolution. To support either use, the critical-path must be identifiable in a consistent, objecti...

While properties of the weighted central path for linear and non-linear programs have been studied for years, the eeect that weighting the central path has on its limiting derivatives has not been fully explored. We show that when there is a unique dual solution, the limiting derivatives of the central path for a linear program are uniformly bounded over a set of normalized weights. Consequentl...

In this paper, we present an automated method for colon registration. The method uses dynamic programming to align data defined on colon center-line paths, as extracted from the prone and supine scans. This data may include information such as path length and curvature as well as descriptors of the shape and size of the colon near the path. We show how our colon registration technique can be us...