Pages that link to "Item:Q5478870"
From MaRDI portal
The following pages link to New criss-cross type algorithms for linear complementarity problems with sufficient matrices (Q5478870):
Displaying 9 items.
- Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
- Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation (Q828652) (← links)
- A polynomial path-following interior point algorithm for general linear complementarity problems (Q989885) (← links)
- EP theorem for dual linear complementarity problems (Q1016385) (← links)
- Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied (Q1787922) (← links)
- Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique (Q2076907) (← links)
- Market exchange models and geometric programming (Q2418159) (← links)
- Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction (Q4971018) (← links)
- The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems (Q5167105) (← links)
