Pages that link to "Item:Q1260955"

The following pages link to The linear complementarity problem, sufficient matrices, and the criss- cross method (Q1260955):

Displaying 17 items.

• Positive-definite tensors to nonlinear complementarity problems (Q274081) (← links)
• 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)
• Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760) (← links)
• Criss-cross methods: A fresh view on pivot algorithms (Q1365063) (← links)
• EP theorems and linear complementarity problems (Q1392569) (← links)
• New variants of finite criss-cross pivot algorithms for linear programming (Q1610181) (← links)
• Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied (Q1787922) (← links)
• The finite criss-cross method for hyperbolic programming (Q1809838) (← links)
• New variants of the criss-cross method for linearly constrained convex quadratic programming (Q1877024) (← links)
• Criteria for sufficient matrices (Q1906774) (← links)
• Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique (Q2076907) (← links)
• On column competent matrices and linear complementarity problem (Q2079987) (← links)
• On ill-posedness and stability of tensor variational inequalities: application to an economic equilibrium (Q2173516) (← links)
• Data-Driven Preference Learning Methods for Value-Driven Multiple Criteria Sorting with Interacting Criteria (Q4995089) (← links)
• The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems (Q5167105) (← links)