The Convergent Generalized Central Paths for Linearly Constrained Convex Programming

The convergence of central paths has been a focal point of research on interior point methods. Quite detailed analyses have been made for the linear case. However, when it comes to the convex case, even if the constraints remain linear, the problem is unsettled. In [Math. Program., 103 (2005), pp. 63--94], Gilbert, Gonzaga, and Karas presented some examples in convex optimization, where the central path fails to converge. In this paper, we aim at finding some continuous trajectories which can converge for all linearly constrained convex optimization problems under some mild assumptions. We design and analyze a class of continuous trajectories, which are the solutions of certain ordinary differential equation (ODE) systems for solving linearly constrained smooth convex programming. The solutions of these ODE systems are named generalized central paths. By only assuming the existence of a finite optimal solution, we are able to show that, starting from any interior feasible point, (i) all of the generalized...

[1]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[2]  E. Akin,et al.  Dynamics of games and genes: Discrete versus continuous time , 1983 .

[3]  Etienne de Klerk,et al.  On the Convergence of the Central Path in Semidefinite Optimization , 2002, SIAM J. Optim..

[4]  Benar Fux Svaiter,et al.  On Well Definedness of the Central Path , 1999 .

[5]  W. Marsden.  I and J , 2012 .

[6]  Chee-Khian Sim,et al.  Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem , 2007, Math. Program..

[7]  Kaare Brandt Petersen,et al.  The Matrix Cookbook , 2006 .

[8]  Jie Sun,et al.  A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions , 1993, Math. Program..

[9]  R. Monteiro,et al.  Limiting behavior of the derivatives of certain trajectories associated with a monotone horizontal linear complementarity problem , 1996 .

[10]  Clóvis C. Gonzaga,et al.  Examples of ill-behaved central paths in convex optimization , 2005, Math. Program..

[11]  Moody T. Chu,et al.  Dynamical System Characterization of the Central Path and Its Variants - A Revisit , 2011, SIAM J. Appl. Dyn. Syst..

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

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

[14]  L. McLinden.  An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem. , 1980 .

[15]  Renato D. C. Monteiro,et al.  Limiting behavior of the affine scaling continuous trajectories for linear programming problems , 1991, Math. Program..

[16]  Chee-Khian Sim,et al.  Asymptotic Behavior of HKM Paths in Interior Point Methods for Monotone Semidefinite Linear Complementarity Problems: General Theory , 2005 .

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

[18]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[19]  Renato D. C. Monteiro,et al.  On the Existence and Convergence of the Central Path for Convex Programming and Some Duality Results , 1998, Comput. Optim. Appl..

[20]  Li-Zhi Liao,et al.  A Study of the Dual Affine Scaling Continuous Trajectories for Linear Programming , 2014, J. Optim. Theory Appl..

[21]  Nicolas Bourbaki,et al.  Functions of a Real Variable , 2003 .

[22]  Shinji Mizuno,et al.  Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems , 1990, Math. Oper. Res..

[23]  Yinyu Ye,et al.  A primal-dual interior point method whose running time depends only on the constraint matrix , 1996, Math. Program..

[24]  Osman Güler,et al.  Limiting behavior of weighted central paths in linear programming , 1994, Math. Program..