Pages that link to "Item:Q1806026"

The following pages link to A polynomial time interior-point path-following algorithm for LCP based on Chen-Harker-Kanzow smoothing techniques (Q1806026):

Displaying 8 items.

• A non-interior implicit smoothing approach to complementarity problems for frictionless contacts (Q646346) (← links)
• A new path-following algorithm for nonlinear \(P_*\) complementarity problems (Q853548) (← links)
• An \(O(rL)\) infeasible interior-point algorithm for symmetric cone LCP via CHKS function (Q1048238) (← 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)
• Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects (Q2802530) (← links)
• (Q5389778) (← links)
• Complexity of a noninterior path-following method for the linear complementarity problem (Q5959900) (← links)