On Well Definedness of the Central Path

We study the well definedness of the central path for a linearly constrained convex programming problem with smooth objective function. We prove that, under standard assumptions, existence of the central path is equivalent to the nonemptiness and boundedness of the optimal set. Other equivalent conditions are given. We show that, under an additional assumption on the objective function, the central path converges to the analytic center of the optimal set.

[1]  Renato D. C. Monteiro,et al.  Interior path following primal-dual algorithms. part I: Linear programming , 1989, Math. Program..

[2]  A. Iusem,et al.  Central Paths, Generalized Proximal Point Methods, and Cauchy Trajectories in Riemannian Manifolds , 1999 .

[3]  G. Sonnevend.  An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming , 1986 .

[4]  Nimrod Megiddo,et al.  Boundary Behavior of Interior Point Algorithms in Linear Programming , 1989, Math. Oper. Res..

[5]  C. C. Gonzaga,et al.  An Algorithm for Solving Linear Programming Problems in O(n 3 L) Operations , 1989 .

[6]  James Renegar,et al.  A polynomial-time algorithm, based on Newton's method, for linear programming , 1988, Math. Program..

[7]  Shinji Mizuno,et al.  A polynomial-time algorithm for a class of linear complementarity problems , 1989, Math. Program..

[8]  Renato D. C. Monteiro,et al.  Interior path following primal-dual algorithms. part II: Convex quadratic programming , 1989, Math. Program..

[9]  D. Bayer,et al.  The Non-Linear Geometry of Linear Pro-gramming I: A?ne and projective scaling trajectories , 1989 .

[10]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[11]  Anthony V. Fiacco,et al.  Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .

[12]  R. C. Monteiro,et al.  Interior path following primal-dual algorithms , 1988 .

[13]  N. Megiddo.  Pathways to the optimal set in linear programming , 1989 .

[14]  Dick den Hertog,et al.  Interior Point Approach to Linear, Quadratic and Convex Programming: Algorithms and Complexity , 1994 .

[15]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..