Pages that link to "Item:Q3491306"

The following pages link to PRACTICAL POLYNOMIAL TIME ALGORITHMS FOR LINEAR COMPLEMENTARITY PROBLEMS (Q3491306):

Displaying 11 items.

• A polynomial-time algorithm for a class of linear complementarity problems (Q1123139) (← links)
• An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem (Q1181916) (← links)
• A new polynomial time method for a linear complementarity problem (Q1207309) (← links)
• A globally convergent primal-dual interior point algorithm for convex programming (Q1330897) (← links)
• The largest step path following algorithm for monotone linear complementarity problems (Q1363413) (← links)
• A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem (Q2175368) (← links)
• Theoretical convergence of large-step primal-dual interior point algorithms for linear programming (Q2366605) (← links)
• Parameterized complexity of sparse linear complementarity problems (Q2408196) (← links)
• A class of polynomially solvable linear complementarity problems (Q2492703) (← links)
• (Q3796984) (← links)
• A Finite Algorithm for Almost Linear Complementarity Problems (Q5438288) (← links)