Japan Journal of Industrial and Applied Mathematics

, Volume 35, Issue 3, pp 1103–1121 | Cite as

A path following interior-point method for linear complementarity problems over circular cones

  • M. Pirhaji
  • M. Zangiabadi
  • H. MansouriEmail author
Original Paper Area 2


Circular cones are a new class of regular cones that include the well-known second-order cones as a special case. In this paper, we study the algebraic structure of the circular cone and show that based on the standard inner product this cone is nonsymmetric while using the new-defined circular inner product this cone not only is symmetric but also the algebra associated with it, is a Euclidean Jordan algebra. Then, using the machinery of Euclidean Jordan algebras and the Nestrov–Todd search directions, we propose a primal-dual path-following interior-point algorithm for linear complementarity problems over the Cartesian product of the circular cones. The convergence analysis of the algorithm is shown and it is proved that this class of mathematical problems is polynomial-time solvable.


Linear complementarity problem Circular cone Interior-point methods Polynomial complexity 

Mathematics Subject Classification

90C25 90C51 



The authors would like to thank the anonymous referees for their useful comments and suggestions, which helped to improve the presentation of this paper. The authors also wish to thank Shahrekord University for financial support. The authors were also partially supported by the Center of Excellence for Mathematics, University of Shahrekord, Shahrekord, Iran.


  1. 1.
    Alizadeh, F., Goldfarb, D.: Second-order cone programming. Math. Program. B 95, 3–51 (2003)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Alzag, B.: The Jordan algebraic structure of the circular cone. Oper. Matrices 11, 1–21 (2017)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Alzag, B., Pirhaji, M.: Primal-dual path-following algorithms for circular programming. Commun. Comb. Optim. 2, 65–85 (2017)MathSciNetzbMATHGoogle Scholar
  4. 4.
    Bai, Y., Ma, P., Zhang, J.: A polynomial-time interior-point method for circular cone programming based on kernel function. J. Ind. Manag. Optim. 12, 739–756 (2016)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Chen, X.D., Sun, D., Sun, J.: Complementarity functions and numerical experiments on some smoothing Newton methods for second-order cone complementarity problems. Comput. Optim. Appl. 25, 39–56 (2003)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Chen, J.S.: Two classes of merit functions for the second-order cone complementarity problem. Math. Methods Oper. Res. 64, 495–519 (2006)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Chang, Y.L., Yang, C.Y., Chen, J.S.: Smooth and nonsmooth analysis of vector-valued functions associated with circular cones. Nonlinear Anal. Theory Methods Appl. 85, 160–173 (2013)CrossRefGoogle Scholar
  8. 8.
    Darvay, Z.: A new algorithm for solving self-dual linear optimization problems. Studia Unive. Babes-Bolyai Ser. Informatica 47, 15–26 (2002)MathSciNetzbMATHGoogle Scholar
  9. 9.
    Darvay, Z.: New interior-point algorithms in linear programming. Adv. Model. Optim. 5, 51–92 (2003)MathSciNetzbMATHGoogle Scholar
  10. 10.
    Darvay, Z., Papp, I.M., Takács, P.R.: Complexity analysis of a full-Newton step interior-point method for linear optimization. Period. Math. Hung. 73, 27–42 (2016)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Darvay, Z., Takács P.R.: New interior-point algorithm for symmetric optimization based on a positive-asympotic barrier function. Technical Report Operations research Report 2016-01, Eotvos Loránd University of Scincs, Budapest (2016)Google Scholar
  12. 12.
    Faraut, J., Koranyi, A.: Analysis on Symmetric Cones. Oxford University Press, Oxford (1994)zbMATHGoogle Scholar
  13. 13.
    Faybusovich, L.: Euclidean Jordan algebras and interior-point algorithms. Positivity 1, 331–357 (1997)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Kojima, M., Shindoh, S., Hara, S.: Interior-point methods for the monotone semidefinite linear complementarity problems. SIAM J. Optim. 7, 86–125 (1997)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Ko, C.H., Chen, J.S.: Optimal grasping manipulation for multifingered robots using semismooth Newton method. Math. Probl. Eng. 2013, 681–710 (2013)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Luo, Z., Xiu, N.: Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones. Sci. China Ser. A 52, 1769–1784 (2009)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Lesaja, L., Wang, G.Q., Zhu, D.T.: Interior-point methods for Cartesian \(P\_{*}(\kappa )\)-linear complementarity problems over symmetric cones based on the eligible kernel functions. Optim. Methods Softw. 27, 827–843 (2012)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Mansouri, H., Zangiabadi, M., Pirhaji, M.: A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems. Nonlinear Anal. Real World Appl. 12, 545–561 (2011)MathSciNetCrossRefGoogle Scholar
  19. 19.
    Mansouri, H., Pirhaji, M.: A polynomial interior-point algorithm for linear complementarity problems. J. Optim. Theory Appl. 157, 451–461 (2013)MathSciNetCrossRefGoogle Scholar
  20. 20.
    Ma, P., Bai, Y., Chen, J.S.: A self-concordant interior point algorithm for nonsymmetric circular cone programming. Nonlinear Convex Anal.
  21. 21.
    Nesterov, Y.: Towards nonsymmetric conic optimization. Optim. Methods Softw. 27, 893–917 (2012)MathSciNetCrossRefGoogle Scholar
  22. 22.
    Pan, S., Li, X., He, S.: An infeasible primal-dual interior-point algorithm for linear programming based on logarithmic equivalenet transformation. J. Math. Anal. Appl. 314, 644–660 (2006)MathSciNetCrossRefGoogle Scholar
  23. 23.
    Potra, F.: An infeasible interior point method for linear complementarity problems over symmetric cones. In: Simos, T. (ed.) Proceedings of the 7th International Conference of Numerical Analysis and Applied Mathematics, Rethymno, Crete, 18–22 September 2009, pp. 1403–1406. Am. Inst. of Phys., New York (2009)Google Scholar
  24. 24.
    Schmieta, S.H., Alizadeh, F.: Extension of primal-dual interior point methods to symmetric cones. Math. Program. A 96, 409–438 (2003)MathSciNetCrossRefGoogle Scholar
  25. 25.
    Skajaa, A., Ye, Y.: Homogeneous interior-point algorithm for nonsymmetric convex conic optimization. Math. Program. (2014).
  26. 26.
    Tseng, P.: Search directions and convergence analysis of some infeasible path-following methods for the monotone semi-definite LCP. Optim. Methods Softw. 9, 245–268 (1998)MathSciNetCrossRefGoogle Scholar
  27. 27.
    Takács, P.R., Darvay, Z.: Infeasible interior-point algorithm for symmetric optimization based on a positive-asympotic barrier function. Technical Report Operations research Report 2016-03, Eotvos Loránd University ofScincs, Budapest (2016)Google Scholar
  28. 28.
    Wang, G.Q., Lesaja, G.: Full Nesterove-Todd step feasible interior-point method for the Cartesian-SCLCP. Optim. Methods Softw. 28, 600–618 (2013)MathSciNetCrossRefGoogle Scholar
  29. 29.
    Zhou, J., Chen, J.S.: Properties of circular cone and spectral factorization associated with circular cone. Nonlinear Convex Anal. 214, 807–816 (2013)MathSciNetzbMATHGoogle Scholar
  30. 30.
    Zhou, J.S., Chen, J.S., Hung, H.: Circular cone convexity and some inequalities associated with circular cones. J. Inequal. Appl. 571, 1–17 (2013)MathSciNetzbMATHGoogle Scholar
  31. 31.
    Zhou, J.C., Chen, J.S., Mordukhovich, B.S.: Variational analysis of the circular cone programs. Optimization 64, 113–147 (2015)MathSciNetCrossRefGoogle Scholar

Copyright information

© The JJIAM Publishing Committee and Springer Japan KK, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Applied Mathematics, Faculty of Mathematical SciencesShahrekord UniversityShahrekordIran

Personalised recommendations