Abstract
Recently several new results have been developed for the asymptotic (local) convergence of polynomial-time interior-point algorithms. It has been shown that the predictor—corrector algorithm for linear programming (LP) exhibits asymptotic quadratic convergence of the primal—dual gap to zero, without any assumptions concerning nondegeneracy, or the convergence of the iteration sequence. In this paper we prove a similar result for the monotone linear complementarity problem (LCP), assuming only that a strictly complementary solution exists. We also show by example that the existence of a strictly complementarity solution appears to be necessary to achieve superlinear convergence for the algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
I. Adler and R. Monteiro, “Limiting behavior of the affine scaling continuous trajectories for linear programming problems,”Contemporary Mathematics 114 (1990) 189–211.
D.A. Bayer and J.C. Lagarias, “Karmarkar's linear programming algorithm and Newton's method,”Mathematical Programming 50 (1991) 291–332.
T.F. Coleman and Y. Li, “A quadratically-convergent algorithm for the linear programming problem with lower and upper bounds,” in: T.F. Coleman and Y. Li, eds.,Large-Scale Numerical Optimization (SIAM, Philadelphia, PA, 1990) pp. 49–57.
G. de Ghellinck and J.-P. Vial, “As polynomial Newton method for linear programming,”Algorithmica 1 (1986) 425–454.
C.C. Gonzaga and M.J. Todd, “An\(O\left( {\sqrt {nL} } \right)\)-iteration large-step primal—dual affine algorithm for linear programming,”SIAM Journal on Optimization 2 (1992) 349–359.
O. Güler and Y. Ye, “Convergence behavior of interior-point algorithms,”Mathematical Programming 60 (1993) 215–228.
A.J. Hoffman, “On approximate solutions of systems of linear inequalities,”Journal of Research of the National Bureau of Standards 49 (1952) 263–265.
M. Iri and H. Imai, “A multiplicative barrier function method for linear programming,”Algorithmica 1 (1986) 455–482.
J. Ji, F. Potra and S. Huang, “A predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence,” Department of Mathematics, The University of Iowa (Iowa City, IA, 1991).
J. Ji, F. Potra, R.A. Tapia and Y. Zhang, “An interior-point method with polynomial complexity and superlinear convergence for linear complementary problems,” Department of Mathematics, The University of Iowa (Iowa City, IA, 1991); also TR91-23, Department of Mathematical Sciences, Rice University (Houston, TX, 1991).
M. Kojima, Y. Kurita and S. Mizuno, “Large step interior-point algorithms for linear complementarity problems,” Research Report B-243, Department of Information Sciences, Tokyo Institute of Technology (Tokyo, Japan, 1991).
M. Kojima, N. Megiddo and S. Mizuno, “Theoretical convergence of large-step primal—dual interior point algorithms for linear programming,”Mathematical Programming 59 (1993) 1–21.
M. Kojima, N. Megiddo and T. Noma, “Homotopy continuation methods for nonlinear complementarity problems,” to appear in:Mathematics of Operations Research.
M. Kojima, S. Mizuno and A. Yoshise, “A polynomial-time algorithm for a class of linear complementarity problems,”Mathematical Programming 44 (1989) 1–26.
Z.Q. Luo and P. Tseng, “Error bounds and convergence analysis of matrix splitting algorithms for the affine variational inequality problem,”SIAM Journal on Optimization 2 (1992) 43–54.
K. McShane, “A superlinearly convergent\(O\left( {\sqrt {nL} } \right)\) iteration primal—dual linear programming algorithm,” to appear in:SIAM Journal on Optimization.
K. McShane, “A superlinearly convergent\(O\left( {\sqrt {nL} } \right)\) iteration interior point algorithm for LCP,” to appear in:SIAM Journal on Optimization.
S. Mehrotra, “Quadratic convergence in a primal—dual method,”Mathematics of Operations Research 18 (1993) 741–751.
S. Mizuno, M.J. Todd and Y. Ye, “On adaptive-step primal—dual interior-point algorithms for linear programming,” to appear in:Mathematics of Operations Research.
R.C. Monteiro, I. Adler and M.G.C. Resende, “A polynomial-time primal—dual affine scaling algorithm for linear and convex quadratic programming and its power series extension,”Mathematics of Operations Research 15 (1990) 191–214.
J.M. Ortega and W.C. Rheinboldt,Iterative Solution of Nonlinear Equations in Several Variables (Academic Press, New York, 1970).
F.A. Potra, “On Q-order and R-order of convergence,”Journal of Optimization Theory and Applications 63 (1989) 415–431.
G. Sonnevend, J. Stoer and G. Zhao, “On the complexity of following the central path by linear extrapolation in linear programs,” to appear in: U. Rieder and P. Kleinschmidt, eds.,Proceedings of the 14-th Symposium on Operations Research (Ulm, 1989).
T. Tsuchiya, “Quadratic convergence of Iri and Imai's algorithm for degenerate linear programming problems,” manuscript, The Institute of Statistical Mathematics (Tokyo, Japan, 1991).
T. Tsuchiya and K. Tanabe, “Local convergence properties of new methods in linear programming,”Journal of the Operations Research Society of Japan 33 (1990) 22–45.
C. Witzgall, P.T. Boggs and P.D. Domich, “On the convergence behavior of trajectories for linear programming,”Contemporary Mathematics 114 (1990) 161–187.
H. Yamashita, “A polynomially and quadratically convergent method for linear programming,” manuscript, Mathematical Systems Institute (Tokyo, Japan, 1986).
Y. Ye, “On the Q-order of convergence of interior-point algorithms for linear programming,” in: Wu Fang, ed.,Proceedings of the 1992 Symposium on Applied Mathematics (Institute of Applied Mathematics, Chinese Academy of Sciences, 1992) pp. 534–543.
Y. Ye, O. Güler, R.A. Tapia and Y. Zhang, “A quadratically convergent\(O\left( {\sqrt {nL} } \right)\)-iteration algorithm for linear programming,”Mathematical Programming 59 (1993) 151–162.
Y. Ye, R.A. Tapia and Y. Zhang, “A superlinearly convergent\(O\left( {\sqrt {nL} } \right)\)-iteration algorithm for linear programming,” TR91-22, Department of Mathematical Sciences, Rice University (Houston, TX, 1991).
Y. Zhang, and R.A. Tapia, “A quadratically convergent polynomial primal—dual interior-point algorithm for linear programming,”SIAM Journal on Optimization 3 (1993) 118–133.
Y. Zhang, R.A. Tapia and J.E. Dennis, “On the superlinear and quadratic convergence of primal—dual interior-point linear programming algorithms,”SIAM Journal on Optimization 2 (1992) 304–323.
Y. Zhang, R.A. Tapia and F. Potra, “On the superlinear convergence of interior-point algorithms for a general class of problems,”SIAM Journal on Optimization 3 (1993) 413–422.
Author information
Authors and Affiliations
Additional information
Research supported in part by NSF Grants DDM-8922636 and DDM-9207347, and an Interdisciplinary Research Grant of the University of Iowa, Iowa Center for Advanced Studies.
Rights and permissions
About this article
Cite this article
Ye, Y., Anstreicher, K. On quadratic and\(O\left( {\sqrt {nL} } \right)\) convergence of a predictor—corrector algorithm for LCP. Mathematical Programming 62, 537–551 (1993). https://doi.org/10.1007/BF01585182
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01585182