On sufficient properties of sufficient matrices
From MaRDI portal
Publication:2051181
DOI10.1007/s10100-021-00747-4OpenAlexW3161956871MaRDI QIDQ2051181
Publication date: 24 November 2021
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-021-00747-4
Related Items (2)
Methodologies and applications for resilient global development from the aspect of SDI-SOR special issues of CJOR ⋮ Stability of the linear complementarity problem properties under interval uncertainty
Uses Software
Cites Work
- On the complexity of computing the handicap of a sufficient matrix
- Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation
- NP-completeness of the linear complementarity problem
- Sufficient matrices and the linear complementarity problem
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- On a subclass of \(P_ 0\)
- Criteria for sufficient matrices
- \(P_ *\)-matrices are just sufficient
- Pseudo-orthants as a generalisation of orthants
- Copositive Programming
- On theP*(κ)horizontal linear complementarity problems over Cartesian product of symmetric cones
- Advanced Linear Algebra
- Contribution of copositive formulations to the graph partitioning problem
- Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction
- Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
- A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution
- Copositivity tests based on the linear complementarity problem
This page was built for publication: On sufficient properties of sufficient matrices
