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):
Displaying 14 items.
- Sufficient weighted complementarity problems (Q288407) (← links)
- Determining the handicap of a sufficient matrix (Q677143) (← 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)
- Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation (Q6491339) (← links)
- A New full-newton step infeasible interior-point method for $$P_*(\kappa )$$-linear Complementarity problem (Q6492455) (← links)
- Unified approach of interior-point algorithms for \(P_* (\kappa)\)-LCPs using a new class of algebraically equivalent transformations (Q6596327) (← links)
- A new Ai-Zhang type interior point algorithm for sufficient linear complementarity problems (Q6596329) (← links)
- Kernel-based full-Newton step feasible interior-point algorithm for \(P_* (\kappa)\)-weighted linear complementarity problem (Q6596330) (← links)
- Sufficient matrices: properties, generating and testing (Q6596334) (← links)
