Pages that link to "Item:Q644911"
From MaRDI portal
The following pages link to On the complexity of computing the handicap of a sufficient matrix (Q644911):
Displayed 7 items.
- Sufficient weighted complementarity problems (Q288407) (← links)
- Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path (Q722338) (← links)
- Column sufficient tensors and tensor complementarity problems (Q722434) (← links)
- Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation (Q828652) (← links)
- On sufficient properties of sufficient matrices (Q2051181) (← links)
- Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique (Q2076907) (← links)
- Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction (Q4971018) (← links)