Asymptotic Behavior of Interior-Point Methods: A View From Semi-Infinite Programming

We study the asymptotic behavior of interior-point methods for linear programming problems. Attempts to solve larger problems using interior-point methods lead to the question of how these algorithms behave as n the number of variables goes to infinity. Here, we take a different point of view and investigate what happens when n is infinite. Motivated by this approach, we study the limits of search directions, potential functions and central paths. We also suggest that the complexity of some linear programming problems may depend on the smoothness of the given problem rather than the number of variables. We prove that when n is infinite, for some subclasses of problems, one can still obtain a bound on the number of iterations required in terms of the smoothness of the problem and the desired accuracy.

[1]  M. Kojima,et al.  A primal-dual interior point algorithm for linear programming , 1988 .

[2]  M. Powell.  Karmarkar's algorithm : a view from nonlinear programming , 1989 .

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

[4]  Michael C. Ferris,et al.  An interior point algorithm for semi-infinite linear programming , 1989, Math. Program..

[5]  Kees Roos,et al.  A survey of search directions in interior point methods for linear programming , 1991, Math. Program..

[6]  E. Anderson,et al.  Linear programming in infinite-dimensional spaces : theory and applications , 1987 .

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

[8]  Michael J. Todd,et al.  A Centered Projective Algorithm for Linear Programming , 1990, Math. Oper. Res..

[9]  Robert J. Vanderbei,et al.  Affine-Scaling Trajectories Associated with a Semi-Infinite Linear Program , 1995, Math. Oper. Res..

[10]  G. Sonnevend,et al.  Applications of the notion of analytic center in approximation (estimation) problems , 1989 .

[11]  Kunio Tanabe,et al.  Centered newton method for mathematical programming , 1988 .

[12]  Zvi Ziegler.  Minimizing the Lp,∞-distortion of trigonometric polynomials☆ , 1977 .

[13]  E. Polak.  On the mathematical foundations of nondifferentiable optimization in engineering design , 1987 .

[14]  Levent Tunçel,et al.  Constant potential primal—dual algorithms: A framework , 1994, Math. Program..

[15]  Shinji Mizuno,et al.  On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming , 1993, Math. Oper. Res..

[16]  C. C. Gonzaga,et al.  An (O√(n) L)-Iteration Large-Step Primal-Dual Affine Algorithm for Linear Programming , 1992, SIAM J. Optim..

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

[19]  Kenneth O. Kortanek,et al.  Semi-Infinite Programming: Theory, Methods, and Applications , 1993, SIAM Rev..

[20]  Jonathan M. Borwein,et al.  Convergence of Best Entropy Estimates , 1991, SIAM J. Optim..

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