Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem
نویسندگان
چکیده
An interior point method (IPM) defines a search direction at each interior point of the feasible region. The search directions at all interior points together form a direction field, which gives rise to a system of ordinary differential equations (ODEs). Given an initial point in the interior of the feasible region, the unique solution of the ODE system is a curve passing through the point, with tangents parallel to the search directions along the curve. We call such curves off-central paths. We study off-central paths for the monotone semidefinite linear complementarity problem (SDLCP). We show that each off-central path is a well-defined analytic curve with parameter μ ranging over (0,∞) and any accumulation point of the off-central path is a solution to SDLCP. Through a simple example we show that the off-central paths are not analytic as a function of √ μ and have first derivatives which are unbounded as a function of μ at μ = 0 in general. On the other hand, for the same example, we can find a subset of off-central paths which are analytic at μ = 0. These “nice” paths are characterized by some algebraic equations.
منابع مشابه
Underlying Paths in Interior Point Method for Monotone Semidefinite Linear Complementarity Problem
An interior point method (IPM) defines a search direction at an interior point of the feasible region. These search directions form a direction field which in turn defines, as the unique solution of a system of ordinary differential equations (ODEs), a curve passing through any interior point. We call such curves off-central paths (the central path is trivial for analysis; our concern is off-ce...
متن کاملA full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
A full Nesterov-Todd (NT) step infeasible interior-point algorithm is proposed for solving monotone linear complementarity problems over symmetric cones by using Euclidean Jordan algebra. Two types of full NT-steps are used, feasibility steps and centering steps. The algorithm starts from strictly feasible iterates of a perturbed problem, and, using the central path and feasi...
متن کاملAsymptotic Behavior of Underlying NT Paths in Interior Point Methods for Monotone Semidefinite Linear Complementarity Problems
An interior point method (IPM) defines a search direction at each interior point of the feasible region. These search directions form a direction field, which in turn gives rise to a system of ordinary differential equations (ODEs). Thus, it is natural to define the underlying paths of the IPM as solutions of the system of ODEs. In [32], these off-central paths are shown to be well-defined anal...
متن کاملSuperlinear Convergence of an Infeasible Predictor-Corrector Path-Following Interior Point Algorithm for a Semidefinite Linear Complementarity Problem Using the Helmberg--Kojima--Monteiro Direction
An interior point method (IPM) defines a search direction at each interior point of a region. These search directions form a direction field which in turn gives rise to a system of ordinary differential equations (ODEs). The solutions of the system of ODEs can be viewed as underlying paths in the interior of the region. In [C.-K. Sim and G. Zhao, Math. Program. Ser. A, 110 (2007), pp. 475–499],...
متن کاملAsymptotic Behavior of HKM Paths in Interior Point Methods for Monotone Semidefinite Linear Complementarity Problems: General Theory
An interior point method (IPM) defines a search direction at each interior point of the feasible region. These search directions form a direction field which in turn gives rise to a system of ordinary differential equations (ODEs). Thus, it is natural to define the underlying paths of the IPM as the solutions of the system of ODEs. In [9], these offcentral paths are shown to be well-defined ana...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Program.
دوره 110 شماره
صفحات -
تاریخ انتشار 2007