Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems

References

• Cottle , R.W. , Pang , J.S. and Stone , R.E. 1992 . The Linear Complementarity Problem, Computer Science and Scientific Computing , San Diego : Academic Press .
   Google Scholar
• Hertog , D.D. , Jarre , F. , Roos , C. and Terlaky , T. 1995 . A sufficient condition for self-concordance with application to some classes of strucutred convex programming problems . Math. Programming , 69 : 75 – 88 .
   Google Scholar
• Hertog , D.D. and Roos , C. 1992 . On the classical logarithmic barrier function method for a class of smooth convex programming problems . J. Optim. Theory Appll , 73 : 1 – 25 .
   Web of Science ®Google Scholar
• Jansen , B. , Roos , C. , Terlaky , T. and Yoshise , A. 1995 . Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems , Japan : University of Tsukuba . Discussion paper No.648,Institute of Soeio-Economic Planning
   Google Scholar
• Ji , J. , Potra , F.A. and Huang , S. 1995 . Predictor-corrector methods for linear complementarity problems with polynomial complexity and superlinear convergence . J. Optim. Theory Appl , 85 : 187 – 199 .
   Google Scholar
• Jarre , F. 1995 . Interior-point methods via self-concordance or relative Lipschitz condition . Optimization Methods and Software , 5 : 75 – 104 .
   Google Scholar
• Kojima , M. , Megiddo , N. , Noma , T. and Yoshise , A. 1991 . “ A unified approach to interior-point algorithm for linear complementarity problems ” . In Lecture Notes in Computer Sciences , Vol. 538 , New York : Springer Verlag .
   Google Scholar
• Miao , J.M. 1995 . A quadratically convergent iteration algorithm for P*matrix linear complementarity problem . Math. Programming , 69 : 355 – 368 .
   Web of Science ®Google Scholar
• Miao , J.M. 1996 . Two infeasible interior point predictor-corrector algorithm for linear programming . SI AM J. Optimization , 6 : 587 – 599 .
   Web of Science ®Google Scholar
• Mizuno , M. , Todd , M.J. and Ye , Y. 1993 . On the adaptive-step primal-dual interior-point algorithms for linear programming . Math. Oper. Res , 18 : 964 – 981 .
   Web of Science ®Google Scholar
• Mclinden , L. 1980 . The analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem . Pacific Journal of Mathematics , 88 : 101 – 161 .
   Web of Science ®Google Scholar
• Nesterov , Y. and Nemirovskii , A.S. 1994 . “ Interior point polynomial algorithm in Convex Programming ” . In SIAM Studies in Applied Mathematics , Vol. 13 , SIAM Philadelphia .
   Google Scholar
• Potra , F.A. 1996 . An infeasible-interior-point predictor-corrector algorithm for linear Programming . SI A M J. Optimization , 6 : 19 – 32 .
   Web of Science ®Google Scholar
• Potra , F.A. and Ye , Y. 1996 . Interior-point methods for monotone complementarity problems . J. Optim. Theory Appl , 88 : 617 – 642 .
   Web of Science ®Google Scholar
• Potra , F.A. and Ye , Y. 1993 . A quadratically convergent polynomial algorithm for solving entropy optimization problems . SIAM J. Optimiziation , 3 : 843 – 860 .
   Web of Science ®Google Scholar
• Sonnevend , G. , Stoer , J. and Zhao , G. 1989 . On the complexity of following the central path of linear programs by linear extra polation . Methods of Oper. Res , 63 : 19 – 31 .
   Google Scholar
• Sonnevend , G. , Stoer , J. and Zhao , G. 1991 . On the complexity of following the central path of linear programs by linear extra polation (part two) . Math. Programming , 52 : 527 – 553 .
   Google Scholar
• Sun , J. , Zhu , J. and Zhao , G. 1997 . A predictor-corrector algorithm for a class of nonlinear saddle-point problems . SIAM J. Control Optim , 35 : 532 – 551 .
   Web of Science ®Google Scholar
• Sun , J. and Zhao , G.A. 1997 . quadratically convergent polynomial long-step algorithm for a class of nonlinear monotone complementarity problems . SIAM J. Optimization , 35 to appear
   Google Scholar
• Sun , J. and Zhao , G. 1998 . Global and local quadratic convergence of a long-step adaptive-mode interior point methods for some monotone variational inequality problem . SIAM J. Optimization , 8 : 123 – 139 .
   Web of Science ®Google Scholar
• Tseng , P. 1992 . Global linear convergence of a path-following algorithm for some monotone variational inequality problems . J. Optim. Theory Appll , 75 : 265 – 279 .
   Web of Science ®Google Scholar
• Tseng , P. 1997 . An infeasible path-following method for monotone complementarity problem . SIAM J. Optimization , 7 : 386 – 402 .
   Web of Science ®Google Scholar
• Väliaho , H. 1996 . “ P* -matrices are just suffient ” . In Linear Algebra and its Applications , 239 – 108 . Helsinki, , Finland : University of Helsinki . Research report, Department of Mathematics
   Google Scholar
• Wu , J.H. 1994 . Interior point algorithm for some monotone variational inequality problems , Canada : Université de Motréal . Preprint, Center for Research on Transportation
   Google Scholar
• Ye , Y. 1992 . A further result on the potential reduction algorithm for the P-matrix linear complementarity problem . Advances in Optimization and Parallel Computing , : 310 – 316 .
   Google Scholar
• Ye , Y. and Pardalos , P.M. 1991 . A class of linear complementarity problems solvable in polynomial time . Linear Algebra and its Applications , 152 : 3 – 17 .
   Web of Science ®Google Scholar
• Ye , Y. , GÜler , O. , Tapia , R. and Zhang , Y. 1993 . A quadratically convergent iterative algorithm for linear programming . Math. Programming , 59 : 151 – 162 .
   Web of Science ®Google Scholar
• Ye , Y. and Anstreicher , K.M. 1993 . On quadratic and convergence of predictor-corrector algorithms for LCP . Math. Programming , 62 : 537 – 551 .
   Web of Science ®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
• Zhao , G. and Stoer , J. 1992 . Estimating the complexity of path-following methods for solving linear programming by curvature integrals . Applied Math. Optim , 27 : 85 – 103 .
   Google Scholar
• Zhao , Y.B. and Han , J.Y. 1996 . Exceptional family of elements for variational inequality and its applications , Beijing : Chinese Academy of Sciences . Research Report, Institute of Applied Mathematics, CAS
   Google Scholar
• Zhao , Y.B. 1996 . New analysis method for existence of a solution to a class of nonsmooth equation , Beijing : CAS . Research Report, Institute of Applied Mathematics
   Google Scholar
• Zhao , Y.B. , Han , J.Y. and Yin , H.X. 1996 . Predictor-corrector algorithm for a class of monotone nonlinear complementarity problems , Vol. TR-17 , Beijing : CAS . Institute of Applied Mathematics
   Google Scholar