Pages that link to "Item:Q4302311"

The following pages link to Superlinearly Convergent $O ( \sqrt{n} L )$-Iteration Interior-Point Algorithms for Linear Programming and the Monotone Linear Complementarity Problem (Q4302311):

Displaying 10 items.

• Potential-reduction methods in mathematical programming (Q1361104) (← 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)
• The sign-based methods for solving a class of nonlinear complementarity problems (Q1730396) (← links)
• A primal-dual interior-point method for linear programming based on a weighted barrier function (Q1906738) (← links)
• A superquadratic infeasible-interior-point method for linear complementarity problems (Q1918925) (← links)
• A full-Newton step interior-point method for monotone weighted linear complementarity problems (Q2198532) (← links)
• Newton-type methods for solving quasi-complementarity problems via sign-based equation (Q2424228) (← links)
• Une procédure de purification pour les problèmes de complémentarité linéaire, monotones (Q5479841) (← links)
• A dynamic model to solve weighted linear complementarity problems (Q6175367) (← links)