A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problemsFootnote^*

^*he research is partially supported by Grant RP930033 of National University of Singapore

References

• Anderson , E and Ye , Y . 1999 . On a homogeneous algorithm for the monotone complementarity problem . Mathematical Programming , 84 : 219 – 226 .
   Google Scholar
• Güler , O . 1993 . Existence of interior point and interior paths in nonlinear monotone complementarity problems . Mathematics of Operations Research , 18 : 128 – 147 .
   Google Scholar
• Güler , O and Ye , Y . 1993 . Convergence behavior of interior point algorithms . Mathematical Programming , 60 : 215 – 228 .
   Web of Science ®Google Scholar
• Kojima , M , Kurita , Y and Mizuno , S . 1993 . Large-step interior point algorithms for linear complementarity problems . SIAM Journal on Optimization , 3 : 398 – 412 .
   Google Scholar
• Kojima , M , Megiddo , N and Mizuno , S . 1992 . Theoretical convergence of large-step primal-dual interior point algorithms for linear programming . Mathematical Programming , 59 : 1 – 21 .
   Google Scholar
• Kojima , M , Megiddo , N and Noma , T . 1991 . Homotopy continuation methods for nonlinear complementarity problems . Mathematics of Operations Research , 16 : 754 – 774 .
   Google Scholar
• Kojima , M , Mizuno , S and Noma , T . 1991 . A new continuation methods for complementarity problems with uniform P-functions . Mathematical Programming , 43 : 107 – 113 .
   Google Scholar
• Kojima , M , Mizuno , S and Yoshise , A . 1989 . “ A primal-dual interior point method for linear programming ” . In Progress in Mathematical Programming-Interior Point and Related Methods , Edited by: Megiddo , N . New York : Springer .
   Google Scholar
• Mizuno , S , Todd , M and Ye , Y . 1993 . On adaptive step primal-dual interior point algorithms for linear programming . Mathematics of Operations Research , 18 : 964 – 981 .
   Web of Science ®Google Scholar
• Nesterov , Y and Nemirovskii , A . 1994 . Interior Point polynomial Algorithms in Convex Programming , Philadelphia, , USA : SIAM Publications .
   Google Scholar
• Potra , F . 1989 . On q-order and r-order of convergence . Journal of Optimization Theory and Applications , 63 : 415 – 431 .
   Web of Science ®Google Scholar
• Potra , F and Ye , Y . 1993 . A quadratically convergent polynomial Algorithm for solving entropy optimizition problems . SIAM journal on Optimization , 3 : 843 – 860 .
   Web of Science ®Google Scholar
• Potra , F and Yc , Y . 1996 . Interior point methods for nonlinear complementarity problems . journal of Optimization Theory and Applications , 88 : 617 – 647 .
   Web of Science ®Google Scholar
• Roos , C , Terlaky , T and Vial , J.Ph . 1997 . Interior Point Approach to Linear Optimization: Theory and Algorithms , New York : Wiley .
   Google Scholar
• Sun , J , Zhu , J and Zhao , G . 1997 . A predictor-corrector algorithm for a class of nonlinear saddle point problems . SIAM Journal on Control and Optimization , 35 : 532 – 551 .
   Web of Science ®Google Scholar
• Tseng , P . 1992 . Global linear convergence of a path-following algorithm for some monotone variational inequality problems . Journal of Optimization Theory and Applications , 75 : 265 – 279 .
   Web of Science ®Google Scholar
• Tseng , P . 1997 . An infeasible path-following method for monotone complementarity problem . SIAM Journal on Optimization , 7 : 386 – 402 .
   Web of Science ®Google Scholar
• Wright , S.J and Ralph , D . 1996 . A superlinear infeasible-interior-point algorithm for Monotone complementarity problems . Mathematics of Operations Research , 21 : 815 – 838 .
   Web of Science ®Google Scholar
• Wu , J.H . 1993 . Interior point algorithm for some monotone variational inequality problem , Canada : Universite de Montreal . Publication 879, CRT
   Google Scholar
• Ye , Y . 1994 . Toward probablistic analysis of interior-point algorithms for linear programming . Mathematics of Operations Research , 19 : 38 – 52 .
   Web of Science ®Google Scholar
• Ye , Y and Anstreicher , K . 1993 . On quadratic and convergence of a predictor-corrector algorithm for LCP . Mathematical Programming , 62 : 537 – 552 .
   Web of Science ®Google Scholar
• Zhang , Y and Tapia , R.A . 1992 . Superlinear and quadratic convergence for primal-dual interior point algorithms for linear programs revisited . Journal on Optimization Theory and Applications , 73 : 229 – 242 .
   Web of Science ®Google Scholar
• Zhao , G . 1998 . Interior point algorithms for linear complementarity problems based on large neighborhoods of the central path . SIAM Journal on Optimization , 8 : 397 – 413 .
   Web of Science ®Google Scholar
• Zhao , G , Sun , J and Zhu , J . 1995 . A primal-dual affine scaling algorithm with necessary centering as a safeguard . Optimization , 35 : 333 – 343 .
   Google Scholar
• Zhu , J . 1992 . A path-following algorithm for a class of convex programming problems . Zeitschrift für Operations Research , 36 : 359 – 377 .
   Google Scholar