Abstract
This paper establishes a theoretical framework of infeasible Mehrotra-type predictor–corrector algorithm for nonmonotone nonlinear complementarity problems over symmetric cones which can be regarded as an extension the Mehrotra’s algorithm proposed by Salahi et al. (On Mehrotra-type predictor–corrector algorithms. SIAM J Optim 18(4):1377–1397, 2005) from nonnegative orthant to symmetric cone. The iteration complexity of the algorithm is estimated, and some numerical results are provided. The numerical results show that the algorithm is efficient and reliable.
Similar content being viewed by others
References
Luo, Z.S., Wu, S.Q., Ye, Y.Y.: Predictor–corrector method for nonlinear complementarity problem. Acta Math. Appl. Sin. E. 13(3), 321–328 (1997)
Zhao, Y.B., Han, J.Y.: Two interior-point methods for nonlinear \(P_*(\kappa )\)-complementarity problems. J. Optim. Theory Appl. 102(3), 659–679 (1999)
Sun, J., Zhao, G.Y.: A quadratically convergent polynomial long-step algorithm for a class of nonlinear monotone complementarity problems. Optim. Methods Softw. 48(4), 453–475 (2000)
Zhao, Y.B., Li, D.: A new path-following algorithm for nonlinear \(P_*(\kappa )\) complementarity problems. Comput. Optim. Appl. 34(2), 183–214 (2005)
Faybusovich, L.: Linear systems in Jordan algebras and primal–dual interior-point algorithms. J. Comput. Appl. Math 86, 149–175 (1997)
Luo, Z.Y., Xiu, N.H.: Path-following interior point algorithms for the Cartesian \(P_*(\kappa )\)-LCP over symmetric cones. SCI China Ser. A. 52, 1769–1784 (2009)
Wang, G.Q., Bai, Y.Q.: A class of polynomial interior point algorithms for the cartesian p-matrix linear complementarity problem over symmetric cones. J. Optim. Theory Appl. 152, 739–772 (2012)
Yoshise, A.: Interior point trajectories and a homogeneous model for nonlinear complementarity problem over symmetric cones. SIAM J. Optim. 17, 1129–1153 (2006)
Andersen, E., Ye, Y.: On a homogeneous algorithm for the monotone complementarity problems. Math. Program. 84, 375–400 (1999)
Yoshise, A.: Homogenous algorithms for monotone complementarity problems over symmetric cones. Pac. J. Optim. 5(2), 313–337 (2008)
Zhao, H.L., Liu, H.W.: Infeasible path-following interior point algorithm for Cartesian \(P_{*}(\kappa )\) nonlinear complementarity problems over symmetric cones. Int. J. Comput. Math. (2017). https://doi.org/10.1080/00207160.2017.1297803
Mehrotra, S.: On the implementation of a primal–dual interior point method. SIAM J. Optim. 2, 575–601 (1992)
Zhang, Y., Zhang, D.: On polynomiality of the Mehrotra-type predictor corrector interior-point algorithms. Math. Program. 68, 303–318 (1995)
Salahi, M., Peng, J., Terlaky, T.: On Mehrotra-type predictor–corrector algorithms. SIAM J. Optim. 18(4), 1377–1397 (2005)
Faraut, J., Kornyi, A.: Analysis on Symmetric Cone. Oxford University Press, New York (1994)
Schmieta, S.H., Alizadeh, F.: Extension of primal–dual interior-point algorithm to symmetric cones. Math. Program. 96, 409–438 (2003)
Rangarajan, B.: Polynomial convergence of infeasible-interior-point methods over symmetric cones. SIAM J. Optim. 16, 1211–1229 (2006)
Muramatsu, M.: On commutative class of search directions for linear programming over symmetric cones. J. Optim. Theory Appl. 112, 595–625 (2002)
Liu, X., Liu, H., Wang, W.: Polynomial convergence of Mehrotra-type predictor–corrector algorithm for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones. Optimization 64(4), 1–23 (2013)
Yang, X., Liu, H., Dong, X.: Polynomial convergence of Mehrotra-type prediction corrector infeasible-IPM for symmetric optimization based on the commutative class directions. Appl. Math. Comput. 230, 616–628 (2014)
Fathi, Y.: Computational complexity of LCPs associated with positive definite matrices. Math. Program. 17, 335–344 (1979)
Ahn, B.H.: Iterative methods for linear complementarity problem with upperbounds and lower-bounds. Math. Program. 26, 265–315 (1983)
Josephy, N.H.: Newton’s method for generalized equations. Int. J. Pure Appl. Math. 1, 1–10 (1979)
Hock, W., Schittkowski, K.: Text examples for nonlinear programming. J. Optim. Theory Appl. 30(1), 127–129 (1980)
Watson, L.T.: Solving the nonlinear complementarity problem by a homotopy method. SIAM J. Control Optim. 17, 36–46 (1979)
Harker, P.T.: Accelerating the convergence of the diagonalization and projection algorithms for finite-dimensional variational inequalities. Math. Program. 41, 29–59 (1988)
Acknowledgements
This work supported by the Natural Science Basic Research Plan in Shaanxi Province of China under Grant 2017JM1014.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Francis Tin-Loi.
Rights and permissions
About this article
Cite this article
Zhao, H., Liu, H. A New Infeasible Mehrotra-Type Predictor–Corrector Algorithm for Nonlinear Complementarity Problems Over Symmetric Cones. J Optim Theory Appl 176, 410–427 (2018). https://doi.org/10.1007/s10957-017-1194-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-017-1194-0
Keywords
- Nonmonotone
- Nonlinear complementarity problem
- Infeasible
- Interior point algorithm
- Symmetric cone
- Predictor corrector