Pages that link to "Item:Q1841556"

The following pages link to A complexity analysis of a smoothing method using CHKS-functions for monotone linear complementarity problems (Q1841556):

Displaying 7 items.

• A polynomial time interior-point path-following algorithm for LCP based on Chen-Harker-Kanzow smoothing techniques (Q1806026) (← links)
• A complexity bound of a predictor-corrector smoothing method using CHKS-func\-tions for monotone LCP (Q1812092) (← 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)
• The locally Chen-Harker-Kanzow-Smale smoothing functions for mixed complementarity problems (Q2423800) (← links)
• An entire space polynomial-time algorithm for linear programming (Q2442633) (← links)
• Complexity of a noninterior path-following method for the linear complementarity problem (Q5959900) (← links)