Pages that link to "Item:Q5959900"
From MaRDI portal
The following pages link to Complexity of a noninterior path-following method for the linear complementarity problem (Q5959900):
Displaying 7 items.
- Some non-interior path-following methods based on a scaled central path for linear complementarity problems (Q969724) (← links)
- An interior point parameterized central path following algorithm for linearly constrained convex programming (Q2113635) (← 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)
- An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
- An entire space polynomial-time algorithm for linear programming (Q2442633) (← links)
- Interior hybrid proximal extragradient methods for the linear monotone complementarity problem (Q2808328) (← links)
- A general class of penalty/barrier path-following Newton methods for nonlinear programming (Q4675963) (← links)
