Pages that link to "Item:Q4946716"

The following pages link to The complexity of high-order predictor-corrector methods for solving sufficient linear complementarity problems (Q4946716):

Displaying 9 items.

• A predictor-corrector algorithm for \(P_{\ast}(\kappa)\)-linear complementarity problems based on a specific self-regular proximity function (Q255679) (← links)
• Corrector-predictor methods for sufficient linear complementarity problems (Q538303) (← links)
• On the complexity of computing the handicap of a sufficient matrix (Q644911) (← links)
• Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path (Q722338) (← links)
• Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions (Q997220) (← links)
• Trajectory-following methods for large-scale degenerate convex quadratic programming (Q2392932) (← links)
• High order infeasible-interior-point methods for solving sufficient linear complementarity problems (Q2757568) (← links)
• The complexity of high-order interior-point methods for solving sufficient complementarity problems. (Q2759585) (← links)
• (Q4250861) (← links)