Pages that link to "Item:Q3202145"

The following pages link to AN O(n^3L) ALGORITHM USING A SEQUENCE FOR A LINEAR COMPLEMENTARITY PROBLEM (Q3202145):

Displaying 13 items.

• A long-step barrier method for convex quadratic programming (Q689102) (← links)
• O(n\({}^ pL)\)-iteration and \(O(n^ 3L)\)-operation potential reduction algorithms for linear programming (Q805163) (← links)
• Strongly polynomial algorithm for a class of combinatorial LCPs (Q1088911) (← links)
• A polynomial-time algorithm for a class of linear complementarity problems (Q1123139) (← links)
• An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems (Q1176569) (← links)
• An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem (Q1181916) (← links)
• Complexity analysis of a linear complementarity algorithm based on a Lyapunov function (Q1184351) (← links)
• Long steps in an \(O(n^ 3L)\) algorithm for linear programming (Q1196717) (← links)
• A finite improvement algorithm for the linear complementarity problem (Q1823161) (← links)
• Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence (Q1893347) (← links)
• An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence (Q1915906) (← links)
• Primal-dual target-following algorithms for linear programming (Q1915912) (← links)
• Theoretical convergence of large-step primal-dual interior point algorithms for linear programming (Q2366605) (← links)