Abstract
We describe an interior-point algorithm for monotone linear complementarity problems in which primal-dual affine scaling is used to generate the search directions. The algorithm is shown to have global and superlinear convergence with Q-order up to (but not including) two. The technique is shown to be consistent with a potential-reduction algorithm, yielding the first potential-reduction algorithm that is both globally and superlinearly convergent.
Similar content being viewed by others
References
J. Ji, F. Potra and S. Huang, “A predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence,” Technical Report, Department of Mathematics, The University of Iowa, Iowa City, IA 52240, USA, August 1991.
J. Ji, F. Potra, R.A. Tapia and Y. Zhang, “An interior-point method with polynomial complexity and superlinear convergence for linear complementarity problems,” Technical Report TR-91-23, Department of Mathematical Sciences, Rice University, Houston, TX 77251, USA, 1991.
M. Kojima, Y. Kurita and S. Mizuno, “Large-step interior point algorithms for linear complementarity problems,”SIAM Journal on Optimization 3 (1993) 398–412.
M. Kojima, N. Meggido, T. Noma and A. Yoshise, “A unified approach to interior-point algorithms for linear complementarity problems,” Lecture Notes in Computer Science 538 (Springer, Berlin, 1991).
M. Kojima, N. Megiddo and T. Noma, “Homotopy continuation methods for nonlinear complementarity problems,”Mathematics of Operations Research 16 (1991) 754–774.
M. Kojima, S. Mizuno and A. Yoshise, “A polynomial-time algorithm for a class of linear complementarity problems,”Mathematical Programming 44 (1989) 1–26.
K.A. McShane, “A superlinearly convergent\(O(\sqrt n L)\) iteration primal-dual linear programming algorithm,”SIAM Journal on Optimization 4 (1994) 247–261.
S. Mehrotra, “Quadratic convergence in a primal-dual method,”Mathematics of Operations Research 18 (1993) 741–751.
S. Mizuno and A. Nagasawa, “A primal-dual affine scaling potential reduction algorithm for linear programming,”Mathematical Programming 62 (1993) 119–131.
S. Mizuno, M.J. Todd and Y. Ye, “On adaptive step primal-dual interior-point algorithms for linear programming,”Mathematics of Operations Research 18 (1993) 945–981.
R.D.C. Monteiro, “A globally convergent primal-dual interior point algorithm for convex programming,”Mathematical Programming 64 (1994) 123–147.
R.D.C. Monteiro and I. Adler, “Interior path-following primal-dual algorithms, Part I: Linear programming,”Mathematical Programming 44 (1989) 27–41.
R.D.C. Monteiro, T. Tsuchiya and Y. Wang, “A simplified global convergence proof of the affine scaling algorithm,”Annals of Operations Research 47 (1993) 443–482.
P. Tseng and Z.Q. Luo, “On the convergence of the affine-scaling algorithm,”Mathematical Programming 56 (1992) 301–319.
T. Tsuchiya, “Quadratic convergence of Iri and Imai's method for degenerate linear programming problems,” Research Memorandum 412, The Institute of Statistical Mathematics, 4-6-7 Minami-Azabu, Minato-ku, Tokyo 106, Japan, 1991.
L. Tunçel, “Constant potential primal-dual algorithms: A framework,”Mathematical Programming 66 (1994) 145–159.
Y. Ye, “On the Q-order of convergence of interior-point algorithms for linear programming,” in: W. Fang, ed.,Proceedings of the 1992 Symposium on Applied Mathematics, Institute of Applied Mathematics, Chinese Academy of Sciences, 1992, pp. 534–543.
Y. Ye and K. Anstreicher, “On quadratic and\(O(\sqrt n L)\) convergence of a predictor-corrector algorithm for LCP,”Mathematical Programming 62 (1993) 537–551.
Y. Ye, O. Güler, R.A. Tapia and Y. Zhang, “A quadratically convergent\(O(\sqrt n L)\)-iteration algorithm for linear programming,”Mathematical Programming 59 (1993) 151–162.
Y. Zhang and R.A. Tapia, “Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited,”Journal of Optimization Theory and Applications 73 (1992) 229–242.
Y. Zhang and R.A. Tapia, “A superlinearly 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–324.
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
Corresponding author. The work of this author was based on research supported by the Office of Scientific Computing, U.S. Department of Energy, under Contract W-31-109-Eng-38.
The work of this author was based on research supported by the National Science Foundation under grant DDM-9109404 and the Office of Naval Research under grant N00014-93-1-0234. This work was done while the author was a faculty member of the Systems and Industrial Engineering Department at the University of Arizona.
Rights and permissions
About this article
Cite this article
Monteiro, R.D.C., Wright, S.J. Superlinear primal-dual affine scaling algorithms for LCP. Mathematical Programming 69, 311–333 (1995). https://doi.org/10.1007/BF01585562
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01585562