Infeasible Mehrotra-type predictor–corrector algorithm for cartesian P_*(κ) nonlinear complementarity problems over symmetric cones

References

• E.D. Andersen and Y. Ye, On a homogeneous algorithm for the monotone complementarity problem, Math. Program. 84 (1999), pp. 375–399. doi: 10.1007/s101070050027
   Web of Science ®Google Scholar
• J. Faraut and A. Kornyi, Analysis on Symmetric Cone, Oxford University Press, New York, 1994.
   Google Scholar
• L. Faybusovich, Linear systems in Jordan algebras and primal-dual interior-point algorithms, J. Comput. Appl. Math. 86 (1997), pp. 149–175. doi: 10.1016/S0377-0427(97)00153-2
   Web of Science ®Google Scholar
• P.T. Harker, Accelerating the convergence of the diagonalization and projection algorithms for finite-dimensional variational inequalities, Math. Program. 41 (1988), pp. 29–59. doi: 10.1007/BF01580752
   Web of Science ®Google Scholar
• W. Hock and K. Schittkowski, Test Examples for Nonlinear Programming Codes, Lecture Notes in Econom. and Math. Systems, 187, Springer-Verlag, Berlin, 1981. doi: 10.1007/978-3-642-48320-2
   Google Scholar
• N.H. Josephy, Newton's method for generalized equations, Techn. summ. rep.n.1965, Math. Res. Center, Univ. of Wisconsin-Madison, Madison, Wisconsin, 1979.
   Google Scholar
• G. Lesaja and C. Roos, Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones, J. Optim. Theory Appl. 150 (2011), pp. 444–474. doi: 10.1007/s10957-011-9848-9
   Web of Science ®Google Scholar
• G. Lesaja, G.Q. Wang, and D.T. Zhu, Interior-point methods for Cartesian P∗(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions, Optim. Methods Softw. 27(4–5) (2012), pp. 827–843. doi: 10.1080/10556788.2012.670858
   Web of Science ®Google Scholar
• X.Z. Liu, H.W. Liu, and C.H. Liu, Infeasible Mehrotra-type predictor–corrector interior-point algorithm for the Cartesian P∗(κ)-LCP over symmetric cones, Numer. Funct. Anal. Optim. 35(5) (2014), pp. 588–610. doi: 10.1080/01630563.2013.836107
   Web of Science ®Google Scholar
• X.Z. Liu, H.W. Liu, and W.W. Wang, Polynomial convergence of Mehrotra-type predictor–corrector algorithm for the Cartesian P∗(κ)-LCP over symmetric cones, Optimization 64(4) (2013), pp. 1–23.
   Web of Science ®Google Scholar
• Z.Y. Luo and N.H. Xiu, An O(rL) infeasible interior-point algorithm for symmetric cone LCP via CHKS function, Acta Appl. Math. 25 (2009), pp. 593–606. doi: 10.1007/s10255-008-8814-2
   Google Scholar
• M. Muramatsu, On a commutative class of search directions for linear programming over symmetric cones, J. Optim. Theory Appl. 112 (2002), pp. 595–625. doi: 10.1023/A:1017920200889
   Web of Science ®Google Scholar
• B.K. Rangarajan, Polynomial convergence of infeasible-interior-point methods over symmetric cones, SIAM J Optim. 16 (2006), pp. 1211–1229. doi: 10.1137/040606557
   Web of Science ®Google Scholar
• S.H. Schmieta and F. Alizadeh, Extension of primal-dual interior point algorithms to symmetric cones, Math. Program. 96 (2003), pp. 409–438. doi: 10.1007/s10107-003-0380-z
   Web of Science ®Google Scholar
• G.Q. Wang and Y.Q. Bai, A class of polynomial interior point algorithms for the cartesian p-matrix linear complementarity problem over symmetric cones, J. Optim. Theory Appl. 152 (2012), pp. 739–772. doi: 10.1007/s10957-011-9938-8
   Web of Science ®Google Scholar
• L.T. Watson, Solving the nonlinear complementarity problem by a homotopy method, SIAM J. Control Optim. 17 (1979), pp. 36–46. doi: 10.1137/0317004
   Web of Science ®Google Scholar
• A. Yoshise, Interior point trajectories and a homogeneous model for nonlinear complementarity problem over symmetric cones, SIAM J. Optim. 17 (2006), pp. 1129–1153. doi: 10.1137/04061427X
   Web of Science ®Google Scholar
• A. Yoshise, Homogenous algorithms for monotone complementarity problems over symmetric cones, Pac. J. Optim. 5(2) (2008), pp. 313–337.
   Web of Science ®Google Scholar
• A. Yoshise, Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects, International Series in Operations Research & Management Science, Vol. 166, 2012, pp. 339–375.
   Google Scholar
• H.L. Zhao and H.W. Liu, Infeasible path-following interior point algorithm for Cartesian P∗(κ) nonlinear complementarity problems over symmetric cones, Int. J. Comput. Math. (2017). doi: 10.1080/00207160.2017.1297803
   Google Scholar
• J. Zhang and K. Zhang, Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming, Math. Methods Oper. Res. 73 (2011), pp. 75–90. doi: 10.1007/s00186-010-0334-1
   Web of Science ®Google Scholar