Pages that link to "Item:Q2867373"

The following pages link to Polynomial interior point algorithms for general linear complementarity problems (Q2867373):

Displaying 25 items.

• Sufficient weighted complementarity problems (Q288407) (← links)
• Some LCPs solvable in strongly polynomial time with Lemke's algorithm (Q344960) (← links)
• A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem (Q607084) (← links)
• Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path (Q722338) (← links)
• New method for determining search directions for interior-point algorithms in linear optimization (Q723503) (← links)
• An extension of interior point potential reduction algorithm to solve general lcps (Q835795) (← links)
• A polynomial path-following interior point algorithm for general linear complementarity problems (Q989885) (← links)
• Strongly polynomial algorithm for a class of combinatorial LCPs (Q1088911) (← links)
• EP theorems and linear complementarity problems (Q1392569) (← links)
• Average number of iterations of some polynomial interior-point -- algorithms for linear programming (Q1589768) (← links)
• Complexity analysis of a full-{N}ewton step interior-point method for linear optimization (Q1677554) (← links)
• Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood (Q1787924) (← links)
• Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique (Q2076907) (← links)
• A corrector-predictor interior-point method with new search direction for linear optimization (Q2201317) (← links)
• A strongly polynomial rounding procedure yielding a maximally complementary solution for \(P_*(\kappa)\) linear complementarity problems (Q2706331) (← links)
• A new polynomial interior-point algorithm for the Cartesian \(P_\ast(\kappa)\) second-order cone linear complementarity problem (Q2793020) (← 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)
• (Q5464291) (← links)
• A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions (Q5745170) (← links)
• Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations (Q6151532) (← links)
• Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation (Q6491339) (← links)
• Unified approach of interior-point algorithms for \(P_* (\kappa)\)-LCPs using a new class of algebraically equivalent transformations (Q6596327) (← links)
• New predictor-corrector algorithm for symmetric cone horizontal linear complementarity problems (Q6596328) (← links)
• Sufficient matrices: properties, generating and testing (Q6596334) (← links)