On sufficient properties of sufficient matrices

• Asadi S, Mansouri H, Darvay Z, Zangiabadi M (2016) On the P\(^*(\kappa )\) horizontal linear complementarity problems over cartesian product of symmetric cones. Optim Methods Softw 31(2):233–257

  Article  Google Scholar 

• Brás C, Eichfelder G, Júdice J (2016) Copositivity tests based on the linear complementarity problem. Comput Optim Appl 63(2):461–493

  Article  Google Scholar 

• Burer S (2012) Copositive programming. In: Handbook on semidefinite, conic and polynomial optimization, Springer, pp 201–218

• Chung S-J (1989) Np-completeness of the linear complementarity problem. J Optim Theory Appl 60(3):393–399

  Article  Google Scholar 

• Cottle R, Pang J-S, Venkateswaran V (1989) Sufficient matrices and the linear complementarity problem. Linear Algebra Appl 114:231–249

  Article  Google Scholar 

• Darvay Z, Illés T, Majoros C (2020a) Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation. Optim Lett 1–20

• Darvay Z, Illés T, Povh J, Rigó PR (2020b) Feasible corrector-predictor interior-point algorithm for \({P}_*(\kappa )\)-linear complementarity problems based on a new search direction. SIAM J Optim 30(3):2628–2658

• de Klerk E, Marianna E et al (2011) On the complexity of computing the handicap of a sufficient matrix. Math Program 129(2):383

  Article  Google Scholar 

• Dür M (2010) Copositive programming—a survey. In: Recent advances in optimization and its applications in engineering, Springer, pp 3–20

• Guu S-M, Cottle R (1995) On a subclass of \({P}_0\). Linear Algebra Appl 223(224):325–335

  Article  Google Scholar 

• Hladík M (2021) Stability of the linear complementarity problem properties under interval uncertainty. Central Eur J Oper Res 1–15

• Illés T, Morapitiye S (2018) Generating sufficient matrices. In: Short papers of the 8th VOCAL optimization conference: advanced algorithms, Published by Pázmány Péter Catholic University, Budapest, p 56

• Kojima M, Megiddo N, Noma T, Yoshise A (1991) A unified approach to interior point algorithms for linear complementarity problems, vol 538, Springer

• Morapitiye S (2019) Sufficient matrices. https://math.bme.hu/~sunil/su-matrices/. Accessed 25 Feb 2019

• MOSEK (2019) ApS. The MOSEK optimization toolbox for MATLAB manual. Version 9.0

• Pandey JN (2014) Pseudo-orthants as a generalisation of orthants. Analysis 34(2):133–142

  Article  Google Scholar 

• Potra FA, Liu X (2005) Predictor-corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path. Optim Methods Softw 20(1):145–168

  Article  Google Scholar 

• Povh J (2013) Contribution of copositive formulations to the graph partitioning problem. Optimization 62(1):71–83

  Article  Google Scholar 

• Roman S, Axler S, Gehring F (2005) Advanced linear algebra, vol 3. Springer, Berlin

  Google Scholar 

• Sun J, Huang Z-H (2006) A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution. Optim Methods Softw 21(4):597–615

  Article  Google Scholar 

• Väliaho H (1996a) Criteria for sufficient matrices. Linear Algebra Appl 233:109–129

• Väliaho H (1996b) \({P}_*\)-matrices are just sufficient. Linear Algebra Appl 239:103–108

Download references