Pages that link to "Item:Q1207309"

The following pages link to A new polynomial time method for a linear complementarity problem (Q1207309):

Displaying 23 items.

• An interior-exterior approach for convex quadratic programming (Q436003) (← links)
• A little theorem of the big \({\mathcal M}\) in interior point algorithms (Q687037) (← links)
• O(n\({}^ pL)\)-iteration and \(O(n^ 3L)\)-operation potential reduction algorithms for linear programming (Q805163) (← 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)
• Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method (Q1293951) (← links)
• A new method for a class of linear variational inequalities (Q1340052) (← links)
• Fast convergence of the simplified largest step path following algorithm (Q1361106) (← links)
• The largest step path following algorithm for monotone linear complementarity problems (Q1363413) (← links)
• Infeasible predictor-corrector interior-point method applied to image restoration in the presence of noise (Q1573984) (← links)
• Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence (Q1893347) (← links)
• A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem (Q1906276) (← links)
• Primal-dual target-following algorithms for linear programming (Q1915912) (← links)
• A class of polynomially solvable linear complementarity problems (Q2492703) (← links)
• AN O(n^3L) ALGORITHM USING A SEQUENCE FOR A LINEAR COMPLEMENTARITY PROBLEM (Q3202145) (← links)
• PRACTICAL POLYNOMIAL TIME ALGORITHMS FOR LINEAR COMPLEMENTARITY PROBLEMS (Q3491306) (← links)
• (Q4021230) (← links)
• (Q4436376) (← links)
• Perturbed path following predictor-corrector interior point algorithms (Q4504781) (← links)
• (Q4735034) (← links)
• New criss-cross type algorithms for linear complementarity problems with sufficient matrices (Q5478870) (← links)
• General central path and the largest step general central path following algorithm for linear programming (Q5949520) (← links)