On the Existence and Convergence of the Central Path for Convex Programming and Some Duality Results

    loading  Checking for direct PDF access through Ovid


This paper gives several equivalent conditions which guarantee the existence of the weighted central paths for a given convex programming problem satisfying some mild conditions. When the objective and constraint functions of the problem are analytic, we also characterize the limiting behavior of these paths as they approach the set of optimal solutions. A duality relationship between a certain pair of logarithmic barrier problems is also discussed.

Related Topics

    loading  Loading Related Articles