Interior-point methods via self-concordance or relative lipschitz condition

In this article we present a simple introduction to the notion of self-concordance and its implications for convex programming. We consider certain interior-point methods for solving convex programs Starting from a straightforward derivation of sufficient conditions that allow the formulation of a polynomial time interior-point method, we give an outline of the method of centers. Our presentation includes a complete analysis of the method as well as some improved results on ellipsoidal approximations of the feasible set

[1]  Bùi-Trong-Liêu,et al.  La mèthode des centres dans un espace topologique , 1966 .

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

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

[4]  G. Sonnevend.  A New Method for Solving a Set of Linear (Convex) Inequalities and its Applications , 1986 .

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

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

[7]  F. Jarre.  On the method of analytic centers for solving smooth convex programs , 1988 .

[8]  Shinji Mizuno,et al.  A new continuation method for complementarity problems with uniformP-functions , 1989, Math. Program..

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

[10]  Pravin M. Vaidya,et al.  An algorithm for linear programming which requires O(((m+n)n2+(m+n)1.5n)L) arithmetic operations , 1990, Math. Program..

[11]  J. Stoer,et al.  Global ellipsoidal approximations and homotopy methods for solving convex analytic programs , 1990 .

[12]  C. Roos,et al.  On the classical logarithmic barrier function method for a class of smooth convex programming problems , 1992 .

[13]  F. Jarre.  Interior-point methods for convex programming , 1992 .

[14]  Stephen P. Boyd,et al.  Method of centers for minimizing generalized eigenvalues , 1993, Linear Algebra and its Applications.

[15]  Shinji Mizuno,et al.  Polynomiality of infeasible-interior-point algorithms for linear programming , 1994, Math. Program..

[16]  Florian Jarre,et al.  A new line-search step based on the Weierstrass $\wp$-function for minimizing a class of logarithmic barrier functions , 1994 .

[17]  Roland W. Freund,et al.  An interior-point method for fractional programs with convex constraints , 1994, Math. Program..

[18]  Shinji Mizuno,et al.  An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm , 1994, Math. Oper. Res..

[19]  Yurii Nesterov,et al.  An interior-point method for generalized linear-fractional programming , 1995, Math. Program..

[20]  Shinji Mizuno,et al.  Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming , 1995, SIAM J. Optim..

[21]  Robert M. Freund,et al.  An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution , 1996, Ann. Oper. Res..

[22]  Florian A. Potra,et al.  An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming , 1996, SIAM J. Optim..

[23]  Robert J. Vanderbei,et al.  A modification of karmarkar's linear programming algorithm , 1986, Algorithmica.