A full Nesterov–Todd step infeasible-interior-point algorithm for Cartesian P_*(κ) horizontal linear complementarity problems over symmetric cones

References

• Faybusovich L. Euclidean Jordan algebras and interior-point algorithm. Positivity. 1997;14:331–357.
   Web of Science ®Google Scholar
• Faybusovich L. Linear systems in Jordan algebras and primal-dual interior-point algorithms.J. Comput. Appl. Math. 1997;86:149–175.
   Web of Science ®Google Scholar
• Faybusovich L. A Jordan-algebraic approach to potential-reduction algorithms. Math. Z. 2002;239:117–129.
   Web of Science ®Google Scholar
• Schmieta SH, Alizadeh F. Extension of primal-dual interior point algorithms to symmetric cones. Math. Program. 2003;96:409–438.
   Web of Science ®Google Scholar
• Gu G, Zangiabadi M, Roos C. Full Nesterov--Todd step interior-point methods for symmetric optimization. Eur. J. Oper. Res. 2011;214:473–484.
   Web of Science ®Google Scholar
• Anitescu M, Lesaja G, Potra FA. Equivalence between different formulations of the linear complementarity problem. Optim. Methods Softw. 1997;7:265–290.
   Web of Science ®Google Scholar
• Kojima M, Megiddo N, Noma T, Yoshise A. A unified approach to interior point algorithms for linear complementarity problems. Lecture notes in computer science. Springer-Verlag:New York (NY); 1991.
   Google Scholar
• Valiaho H. P*-matrices are just sufficient. Linear Algebra Appl. 1996;239:103–108.
   Web of Science ®Google Scholar
• Cottle RW, Pang JS, Venkateswaran V. Sufficient matrices and the linear complementarity problem. Linear Algebra Appl. 1989;114:231–249.
   Web of Science ®Google Scholar
• Gurtuna F, Petra C, Potra FA, Shevchenko O, Vancea A. Corrector-Predictor methods for sufficient linear complementarity problems. Comput. Optim. Appl. 2011;48:453–485.
   Web of Science ®Google Scholar
• Wang GQ, Bai YQ. Polynomial interior-point algorithms for P*(κ) horizontal linear complementarity problem. J. Comput. Appl. Math. 2009;233:248–263.
   Web of Science ®Google Scholar
• Asadi S, Mansouri H. Polynomial interior-point algorithm for P*(κ) horizontal linear complementarity problems. Numer. Algorithms. 2012;63:385–398.
   Web of Science ®Google Scholar
• Asadi S, Mansouri H. A new full-Newton step O(n) infeasible interior-point algorithm for P*(κ)-horizontal linear complementarity problems. Comp. Sci. J. Moldova. 2014;22:37–61.
   Google Scholar
• Gowda MS, Sznajder R. Some global uniqueness and solvability results for linear complementarity problems over symmetric cones. SIAM J. Optim. 2007;18:461–481.
   Web of Science ®Google Scholar
• Yoshise A. Interior point trajectories and a homogeneous model for nonlinear complementarity problems over symmetric cones. SIAM J. Optim. 2007;17:1129–1153.
   Web of Science ®Google Scholar
• Luo ZY, Xiu NH. Path-following interior point algorithms for the Cartesian P*(κ)-LCP over symmetric cones. Sci. China Ser. A: Math. 2009;52:1769–1784.
   Google Scholar
• Chen X, Qi HD. Cartesian P-property and its applications to the semidefinite linear complementarity problem. Math. Program. 2006;106:177–201.
   Web of Science ®Google Scholar
• Kong LC, Tancel L, Xiu NH. Vector-valued implicit lagrangian for symmetric cone complementarity problems, Research Report CORR 2006-24. Depaetment of combinatorics and optimization. Waterloo: University of Waterloo; 2006.
   Google Scholar
• Wang GQ, Lesaja G. Full Nestero-Todd step feasible interior-point method for the Cartesian P*(κ)-SCLCP. Optim. Methods Softw. 2013;28:600–618.
   Web of Science ®Google Scholar
• Roos C. A full-Newton step O(n) infeasible interior-point algorithm for linear optimization. SIAM J. Optim. 2006;16:1110–1136.
   Web of Science ®Google Scholar
• Zangiabadi M, Gu G, Roos C. A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization. J. Optim. Theory. Appl. 2013;158:816–858.
   Web of Science ®Google Scholar
• Gu G. Full-step interior-point methods for symmetric optimization [PhD thesis]. Delft University of Technology. 2009.
   Google Scholar
• Faraut J, Koranyi A. Analysis on symmetric cones. Oxford mathematical monographs. The Clarendon Press, Oxford University Press, Oxford Science Publications: New York (NY); 1994.
   Google Scholar
• Vieira VC. 2007. Jordan algebraic approach to symmetric optimization [PhD thesis]. Delft University of Technology.
   Google Scholar
• Rangarajan BK. Polynomial convergence of infeasible-interior-point methods over symmetric cones. SIAM J. Optim. 2006;16:1211–1229.
   Web of Science ®Google Scholar
• Sturm JF. Similarity and other spectral relations for symmetric cones. Linear Algebra Appl. 2000;312:135–154.
   Web of Science ®Google Scholar
• Asadi S, Mansouri H, Zangiabadi M. On the P*(κ) horizontal linear complementarity problems over Cartesian product of symmetric cones. Optim. Methods Softw. forthcoming. Available from: http://dx.doi.org/10.1080/10556788.2015.1058795.
   Google Scholar
• Potra FA, Stoer J. On a class of superlinearly convergent polynomial time interior point methods for sufficient LCP. SIAM J. Optim. 2009;20:1333–1363.
   Web of Science ®Google Scholar
• Roos C, Terlaky T, Vial J-Ph. Interior point methods for linear optimization. New York (NY): Springer; 2006.
   Google Scholar