Global Linear and Local Quadratic Convergence of a Long-Step Adaptive-Mode Interior Point Method for Some Monotone Variational Inequality Problems

An interior point (IP) method is proposed to solve variational inequality problems for monotone functions and polyhedral sets. The method has the following advantages: 1. Given an initial interior feasible solution with duality gap $\mu_0$, the algorithm requires at most $O[n\log(\mu_0/\ep)]$ iterations to obtain an ep-optimal solution. 2. The rate of convergence of the duality gap is q-quadratic. 3. At each iteration, a long-step improvement is allowed. 4. The algorithm can automatically transfer from a linear mode to a quadratic mode to accelerate the local convergence.

[1]  Stephen J. Wright,et al.  A Superlinear Infeasible-Interior-Point Algorithm for Monotone Complementarity Problems , 1996, Math. Oper. Res..

[2]  Florian Jarre,et al.  A sufficient condition for self-concordance, with application to some classes of structured convex programming problems , 1995, Math. Program..

[3]  Paul Tseng,et al.  An Infeasible Path-Following Method for Monotone Complementarity Problems , 1997, SIAM J. Optim..

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

[5]  Yinyu Ye,et al.  Convergence behavior of interior-point algorithms , 1993, Math. Program..

[6]  Jie Sun,et al.  A Predictor-Corrector Algorithm for a Class of Nonlinear Saddle Point Problems , 1997 .

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

[8]  Clovis C. Gonzaga,et al.  Complexity of Predictor-Corrector Algorithms for LCP Based on a Large Neighborhood of the Central Path , 1999, SIAM J. Optim..

[9]  Shinji Mizuno,et al.  Theoretical convergence of large-step primal—dual interior point algorithms for linear programming , 1993, Math. Program..

[10]  Roy E. Marsten,et al.  The interior-point method for linear programming , 1992, IEEE Software.

[11]  Stephen J. Wright,et al.  Superlinear convergence of an interior-point method for monotone variational inequalities , 1996 .

[12]  Jishan Zhu,et al.  A path following algorithm for a class of convex programming problems , 1992, ZOR Methods Model. Oper. Res..

[13]  Y. Ye,et al.  Interior-point methods for nonlinear complementarity problems , 1996 .

[14]  Clóvis C. Gonzaga,et al.  The largest step path following algorithm for monotone linear complementarity problems , 1997, Math. Program..

[15]  P. Tseng.  Global linear convergence of a path-following algorithm for some monotone variational inequality problems , 1992 .

[16]  Zhi-Quan Luo,et al.  A Genuine Quadratically Convergent Polynomial Interior Point Algorithm for Linear Programming , 1994 .

[17]  Tamás Terlaky,et al.  Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems , 1997, Math. Program..

[18]  Yinyu Ye,et al.  On a homogeneous algorithm for the monotone complementarity problem , 1999, Math. Program..